java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:26:04,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:26:04,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:26:04,237 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:26:04,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:26:04,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:26:04,240 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:26:04,242 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:26:04,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:26:04,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:26:04,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:26:04,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:26:04,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:26:04,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:26:04,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:26:04,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:26:04,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:26:04,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:26:04,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:26:04,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:26:04,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:26:04,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:26:04,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:26:04,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:26:04,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:26:04,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:26:04,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:26:04,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:26:04,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:26:04,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:26:04,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:26:04,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:26:04,271 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:26:04,271 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:26:04,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:26:04,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:26:04,273 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:26:04,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:26:04,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:26:04,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:26:04,289 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:26:04,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:26:04,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:26:04,290 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:26:04,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:26:04,291 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:26:04,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:26:04,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:26:04,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:26:04,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:26:04,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:26:04,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:26:04,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:26:04,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:26:04,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:26:04,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:26:04,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:26:04,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:26:04,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:26:04,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:26:04,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:26:04,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:26:04,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:26:04,294 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:26:04,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:26:04,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:26:04,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:26:04,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:26:04,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:26:04,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:26:04,372 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:26:04,375 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:26:04,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-09-30 20:26:04,376 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-09-30 20:26:04,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:26:04,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:26:04,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:26:04,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:26:04,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:26:04,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,505 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:26:04,505 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:26:04,506 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:26:04,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:26:04,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:26:04,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:26:04,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:26:04,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... [2018-09-30 20:26:04,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:26:04,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:26:04,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:26:04,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:26:04,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:26:04,619 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 20:26:04,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 20:26:04,619 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-30 20:26:04,822 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:26:04,823 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:26:04 BoogieIcfgContainer [2018-09-30 20:26:04,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:26:04,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:26:04,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:26:04,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:26:04,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:26:04" (1/2) ... [2018-09-30 20:26:04,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202ea0f and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:26:04, skipping insertion in model container [2018-09-30 20:26:04,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:26:04" (2/2) ... [2018-09-30 20:26:04,832 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-09-30 20:26:04,843 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:26:04,858 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:26:04,973 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:26:04,974 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:26:04,975 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:26:04,975 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:26:04,975 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:26:04,975 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:26:04,975 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:26:04,976 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:26:04,976 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:26:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-30 20:26:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:26:05,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:05,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:26:05,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:05,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-30 20:26:05,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:05,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:05,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:05,330 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:26:05,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 20:26:05,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:26:05,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:26:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:26:05,355 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-30 20:26:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:05,476 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-30 20:26:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:26:05,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 20:26:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:05,491 INFO L225 Difference]: With dead ends: 17 [2018-09-30 20:26:05,492 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 20:26:05,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:26:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 20:26:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-30 20:26:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 20:26:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 20:26:05,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-30 20:26:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:05,534 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 20:26:05,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:26:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 20:26:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:26:05,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:05,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:26:05,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:05,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-30 20:26:05,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:05,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:05,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:05,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:05,619 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:05,619 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:05,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:05,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:05,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:05,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:05,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:05,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:05,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:05,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-30 20:26:05,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:26:05,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:26:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:26:05,873 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-30 20:26:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:05,989 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 20:26:05,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:26:05,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-30 20:26:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:05,990 INFO L225 Difference]: With dead ends: 15 [2018-09-30 20:26:05,990 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 20:26:05,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:26:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 20:26:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-30 20:26:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 20:26:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 20:26:05,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-30 20:26:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:05,996 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 20:26:05,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:26:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 20:26:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:26:05,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:05,998 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-30 20:26:05,998 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:05,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-30 20:26:05,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:05,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:06,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:06,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:06,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:06,228 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:06,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:06,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:06,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:06,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:06,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:06,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:06,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:06,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-30 20:26:06,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:26:06,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:26:06,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:26:06,471 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-30 20:26:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:06,545 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 20:26:06,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:26:06,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:26:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:06,548 INFO L225 Difference]: With dead ends: 19 [2018-09-30 20:26:06,548 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 20:26:06,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:26:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 20:26:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-30 20:26:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 20:26:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 20:26:06,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-30 20:26:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:06,555 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 20:26:06,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:26:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 20:26:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:26:06,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:06,556 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-30 20:26:06,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:06,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-30 20:26:06,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:06,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:06,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:06,679 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:06,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:06,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:06,771 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 20:26:06,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:06,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:06,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:06,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:06,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:06,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:06,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 20:26:06,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:26:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:26:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:26:06,961 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-30 20:26:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:07,017 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 20:26:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:26:07,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 20:26:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:07,021 INFO L225 Difference]: With dead ends: 23 [2018-09-30 20:26:07,021 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 20:26:07,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:26:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 20:26:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-30 20:26:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 20:26:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 20:26:07,027 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-30 20:26:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:07,027 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 20:26:07,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:26:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 20:26:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:26:07,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:07,029 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-30 20:26:07,029 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:07,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-30 20:26:07,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:07,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:07,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:07,171 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:07,171 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:07,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:07,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:07,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:07,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:07,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:07,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:07,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:07,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 20:26:07,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:26:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:26:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:26:07,690 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-30 20:26:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:07,803 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-30 20:26:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:26:07,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-30 20:26:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:07,804 INFO L225 Difference]: With dead ends: 27 [2018-09-30 20:26:07,804 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 20:26:07,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:26:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 20:26:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-30 20:26:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 20:26:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-30 20:26:07,812 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-30 20:26:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:07,813 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-30 20:26:07,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:26:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-30 20:26:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 20:26:07,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:07,814 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-30 20:26:07,814 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:07,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-30 20:26:07,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:07,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:07,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:07,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:07,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:08,000 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 20:26:08,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:08,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:08,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:08,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:08,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:08,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:08,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:08,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 20:26:08,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:26:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:26:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:26:08,166 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-30 20:26:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:08,225 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 20:26:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:26:08,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 20:26:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:08,228 INFO L225 Difference]: With dead ends: 31 [2018-09-30 20:26:08,228 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 20:26:08,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:26:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 20:26:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-30 20:26:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 20:26:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-30 20:26:08,234 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-30 20:26:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:08,234 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-30 20:26:08,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:26:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-30 20:26:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 20:26:08,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:08,235 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-30 20:26:08,236 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:08,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-30 20:26:08,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:08,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:08,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:08,501 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:08,501 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:08,510 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:08,547 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 20:26:08,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:08,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:08,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:08,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:08,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:08,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:08,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:08,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:26:08,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:26:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:26:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:26:08,753 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-30 20:26:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:08,883 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 20:26:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:26:08,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-30 20:26:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:08,885 INFO L225 Difference]: With dead ends: 35 [2018-09-30 20:26:08,886 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 20:26:08,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:26:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 20:26:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-30 20:26:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 20:26:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-30 20:26:08,892 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-30 20:26:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:08,892 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-30 20:26:08,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:26:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-30 20:26:08,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 20:26:08,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:08,894 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-30 20:26:08,894 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:08,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-30 20:26:08,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:08,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:08,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:08,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:09,039 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:09,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:09,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:09,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:09,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:09,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:09,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:09,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:09,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:09,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 20:26:09,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:26:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:26:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:26:09,340 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-30 20:26:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:09,624 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-30 20:26:09,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:26:09,625 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-30 20:26:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:09,626 INFO L225 Difference]: With dead ends: 39 [2018-09-30 20:26:09,627 INFO L226 Difference]: Without dead ends: 38 [2018-09-30 20:26:09,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:26:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-30 20:26:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-30 20:26:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 20:26:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 20:26:09,633 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-30 20:26:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:09,633 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 20:26:09,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:26:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 20:26:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 20:26:09,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:09,635 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-30 20:26:09,635 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:09,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-30 20:26:09,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:09,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:09,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:09,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:09,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:09,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:09,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:09,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:09,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:09,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:09,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:09,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:09,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:09,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:10,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:10,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 20:26:10,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:26:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:26:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:26:10,128 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-30 20:26:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:10,277 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-30 20:26:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:26:10,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-30 20:26:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:10,278 INFO L225 Difference]: With dead ends: 43 [2018-09-30 20:26:10,278 INFO L226 Difference]: Without dead ends: 42 [2018-09-30 20:26:10,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:26:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-30 20:26:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-30 20:26:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 20:26:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 20:26:10,284 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-30 20:26:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:10,284 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 20:26:10,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:26:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 20:26:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 20:26:10,286 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:10,286 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-30 20:26:10,286 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:10,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-30 20:26:10,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:10,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:10,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:10,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:10,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:10,471 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:10,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:10,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:10,625 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 20:26:10,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:10,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:10,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:10,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:10,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:10,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:11,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:11,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 20:26:11,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:26:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:26:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:26:11,344 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-30 20:26:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:11,453 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-30 20:26:11,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:26:11,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-30 20:26:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:11,455 INFO L225 Difference]: With dead ends: 47 [2018-09-30 20:26:11,455 INFO L226 Difference]: Without dead ends: 46 [2018-09-30 20:26:11,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:26:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-30 20:26:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-30 20:26:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 20:26:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-30 20:26:11,463 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-30 20:26:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:11,463 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-30 20:26:11,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:26:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-30 20:26:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 20:26:11,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:11,465 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-30 20:26:11,465 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:11,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-30 20:26:11,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:11,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:11,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:11,725 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:11,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:11,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:11,762 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:11,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:11,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:11,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:11,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:11,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:11,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:12,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:12,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-30 20:26:12,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 20:26:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 20:26:12,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:26:12,100 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-30 20:26:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:12,198 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 20:26:12,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:26:12,199 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-30 20:26:12,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:12,201 INFO L225 Difference]: With dead ends: 51 [2018-09-30 20:26:12,201 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 20:26:12,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:26:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 20:26:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-30 20:26:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-30 20:26:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-30 20:26:12,207 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-30 20:26:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:12,207 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-30 20:26:12,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 20:26:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-30 20:26:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 20:26:12,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:12,208 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-30 20:26:12,209 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:12,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-30 20:26:12,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:12,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:13,083 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:13,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:13,159 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 20:26:13,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:13,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:13,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:13,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:13,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:13,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:13,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:13,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-30 20:26:13,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 20:26:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 20:26:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:26:13,649 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-30 20:26:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:13,755 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 20:26:13,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:26:13,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-30 20:26:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:13,756 INFO L225 Difference]: With dead ends: 55 [2018-09-30 20:26:13,756 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 20:26:13,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:26:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 20:26:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-30 20:26:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 20:26:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-30 20:26:13,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-30 20:26:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:13,762 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-30 20:26:13,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 20:26:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-30 20:26:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 20:26:13,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:13,764 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-30 20:26:13,764 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:13,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-30 20:26:13,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:13,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,433 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:14,433 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:14,441 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:14,474 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 20:26:14,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:14,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:14,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:14,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:14,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:14,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:14,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:14,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-30 20:26:14,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 20:26:14,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 20:26:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:14,743 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-30 20:26:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:14,867 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-30 20:26:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:26:14,868 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-30 20:26:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:14,869 INFO L225 Difference]: With dead ends: 59 [2018-09-30 20:26:14,869 INFO L226 Difference]: Without dead ends: 58 [2018-09-30 20:26:14,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:26:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-30 20:26:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-30 20:26:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 20:26:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 20:26:14,877 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-30 20:26:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:14,878 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 20:26:14,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 20:26:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 20:26:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 20:26:14,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:14,879 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-30 20:26:14,880 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:14,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:14,880 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-30 20:26:14,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:14,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:14,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,470 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:15,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:15,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:15,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:15,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:15,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:15,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:15,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:15,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-30 20:26:15,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 20:26:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 20:26:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:26:15,936 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-30 20:26:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:16,152 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-30 20:26:16,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:26:16,152 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-30 20:26:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:16,153 INFO L225 Difference]: With dead ends: 63 [2018-09-30 20:26:16,153 INFO L226 Difference]: Without dead ends: 62 [2018-09-30 20:26:16,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:26:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-30 20:26:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-30 20:26:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 20:26:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-30 20:26:16,161 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-30 20:26:16,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:16,161 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-30 20:26:16,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 20:26:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-30 20:26:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 20:26:16,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:16,162 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-30 20:26:16,163 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:16,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:16,163 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-30 20:26:16,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:16,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:16,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:16,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:16,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:16,485 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:16,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:16,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:16,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:16,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:16,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:16,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:16,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-30 20:26:16,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 20:26:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 20:26:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:16,881 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-30 20:26:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:17,007 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-30 20:26:17,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:26:17,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-30 20:26:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:17,009 INFO L225 Difference]: With dead ends: 67 [2018-09-30 20:26:17,009 INFO L226 Difference]: Without dead ends: 66 [2018-09-30 20:26:17,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:26:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-30 20:26:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-30 20:26:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-30 20:26:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-30 20:26:17,016 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-30 20:26:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:17,016 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-30 20:26:17,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 20:26:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-30 20:26:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-30 20:26:17,017 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:17,018 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-30 20:26:17,018 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:17,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-30 20:26:17,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:17,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,434 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:17,434 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:17,482 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 20:26:17,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:17,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:17,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:17,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:17,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:17,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:17,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-30 20:26:17,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 20:26:17,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 20:26:17,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:17,810 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-30 20:26:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:18,072 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-30 20:26:18,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:26:18,072 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-30 20:26:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:18,073 INFO L225 Difference]: With dead ends: 71 [2018-09-30 20:26:18,073 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 20:26:18,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:26:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 20:26:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-30 20:26:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-30 20:26:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-30 20:26:18,079 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-30 20:26:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:18,080 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-30 20:26:18,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 20:26:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-30 20:26:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 20:26:18,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:18,081 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-30 20:26:18,082 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:18,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:18,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-30 20:26:18,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:18,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:18,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:18,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,396 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:18,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:18,430 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:18,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:18,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:18,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:18,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:18,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:18,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:18,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-30 20:26:18,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 20:26:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 20:26:18,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:26:18,926 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-30 20:26:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:19,056 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-30 20:26:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:26:19,056 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-30 20:26:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:19,057 INFO L225 Difference]: With dead ends: 75 [2018-09-30 20:26:19,057 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 20:26:19,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:26:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 20:26:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-30 20:26:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 20:26:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-30 20:26:19,063 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-30 20:26:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:19,063 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-30 20:26:19,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 20:26:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-30 20:26:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-30 20:26:19,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:19,065 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-30 20:26:19,065 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:19,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-30 20:26:19,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:19,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:19,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:19,417 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:19,463 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 20:26:19,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:19,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:19,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:19,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:19,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:19,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:19,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:19,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-30 20:26:19,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 20:26:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 20:26:19,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:19,855 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-30 20:26:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:19,963 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-30 20:26:19,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:26:19,964 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-30 20:26:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:19,965 INFO L225 Difference]: With dead ends: 79 [2018-09-30 20:26:19,965 INFO L226 Difference]: Without dead ends: 78 [2018-09-30 20:26:19,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:26:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-30 20:26:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-30 20:26:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 20:26:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-30 20:26:19,971 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-30 20:26:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:19,972 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-30 20:26:19,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 20:26:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-30 20:26:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 20:26:19,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:19,973 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-30 20:26:19,974 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:19,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:19,974 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-30 20:26:19,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:19,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:19,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:19,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:20,262 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:20,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:20,270 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:20,323 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 20:26:20,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:20,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:20,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:20,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:20,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:20,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:21,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-30 20:26:21,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 20:26:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 20:26:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:21,116 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-30 20:26:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:21,225 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-30 20:26:21,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:26:21,225 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-30 20:26:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:21,226 INFO L225 Difference]: With dead ends: 83 [2018-09-30 20:26:21,226 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 20:26:21,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:26:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 20:26:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-30 20:26:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 20:26:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-30 20:26:21,231 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-30 20:26:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:21,232 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-30 20:26:21,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 20:26:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-30 20:26:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 20:26:21,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:21,233 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-30 20:26:21,233 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:21,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-30 20:26:21,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:21,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:21,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:21,651 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:21,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:21,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:21,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:21,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:21,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:21,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:21,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:22,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:22,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-30 20:26:22,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 20:26:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 20:26:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:26:22,439 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-30 20:26:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:22,672 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-30 20:26:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:26:22,673 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-30 20:26:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:22,674 INFO L225 Difference]: With dead ends: 87 [2018-09-30 20:26:22,674 INFO L226 Difference]: Without dead ends: 86 [2018-09-30 20:26:22,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:26:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-30 20:26:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-30 20:26:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 20:26:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-30 20:26:22,681 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-30 20:26:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:22,681 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-30 20:26:22,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 20:26:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-30 20:26:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 20:26:22,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:22,682 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-30 20:26:22,683 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-30 20:26:22,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:23,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:23,774 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:23,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:23,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:23,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:23,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:23,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:23,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:23,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:23,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:24,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:24,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-30 20:26:24,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 20:26:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 20:26:24,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:24,189 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-30 20:26:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:24,358 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-30 20:26:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:26:24,358 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-30 20:26:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:24,360 INFO L225 Difference]: With dead ends: 91 [2018-09-30 20:26:24,360 INFO L226 Difference]: Without dead ends: 90 [2018-09-30 20:26:24,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 20:26:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-30 20:26:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-30 20:26:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 20:26:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-30 20:26:24,365 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-30 20:26:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:24,365 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-30 20:26:24,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 20:26:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-30 20:26:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-30 20:26:24,366 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:24,366 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-30 20:26:24,367 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:24,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-30 20:26:24,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:24,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:24,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:25,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:25,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:25,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:25,381 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 20:26:25,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:25,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:25,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:25,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:25,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:26,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:26,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-30 20:26:26,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 20:26:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 20:26:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:26,892 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-30 20:26:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:27,051 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-30 20:26:27,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:26:27,059 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-30 20:26:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:27,059 INFO L225 Difference]: With dead ends: 95 [2018-09-30 20:26:27,059 INFO L226 Difference]: Without dead ends: 94 [2018-09-30 20:26:27,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:26:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-30 20:26:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-30 20:26:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:26:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-30 20:26:27,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-30 20:26:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:27,063 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-30 20:26:27,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 20:26:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-30 20:26:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 20:26:27,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:27,064 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-30 20:26:27,064 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:27,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-30 20:26:27,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:27,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:27,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:27,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:27,489 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:27,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:27,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:27,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:27,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:27,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:27,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:27,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-30 20:26:27,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 20:26:27,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 20:26:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:26:27,955 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-30 20:26:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:28,114 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-30 20:26:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:26:28,115 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-30 20:26:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:28,116 INFO L225 Difference]: With dead ends: 99 [2018-09-30 20:26:28,116 INFO L226 Difference]: Without dead ends: 98 [2018-09-30 20:26:28,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:26:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-30 20:26:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-30 20:26:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 20:26:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-30 20:26:28,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-30 20:26:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:28,122 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-30 20:26:28,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 20:26:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-30 20:26:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 20:26:28,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:28,123 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-30 20:26:28,123 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:28,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-30 20:26:28,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:28,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:28,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:28,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:28,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:28,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:28,522 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:28,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:28,581 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 20:26:28,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:28,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:28,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:28,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:28,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:29,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:29,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-30 20:26:29,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 20:26:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 20:26:29,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:29,358 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-30 20:26:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:29,594 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-30 20:26:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:26:29,595 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-30 20:26:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:29,596 INFO L225 Difference]: With dead ends: 103 [2018-09-30 20:26:29,596 INFO L226 Difference]: Without dead ends: 102 [2018-09-30 20:26:29,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:26:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-30 20:26:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-30 20:26:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 20:26:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-30 20:26:29,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-30 20:26:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:29,603 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-30 20:26:29,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 20:26:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-30 20:26:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 20:26:29,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:29,603 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-30 20:26:29,604 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:29,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:29,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-30 20:26:29,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:29,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:29,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:29,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:29,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:30,241 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:30,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:30,248 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:30,309 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 20:26:30,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:30,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:30,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:30,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:30,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:30,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:31,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:31,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-30 20:26:31,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 20:26:31,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 20:26:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:31,091 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-30 20:26:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:31,316 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-30 20:26:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:26:31,316 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-30 20:26:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:31,317 INFO L225 Difference]: With dead ends: 107 [2018-09-30 20:26:31,317 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 20:26:31,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 20:26:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 20:26:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-30 20:26:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-30 20:26:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-30 20:26:31,322 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-30 20:26:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:31,323 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-30 20:26:31,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 20:26:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-30 20:26:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-30 20:26:31,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:31,324 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-30 20:26:31,324 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-30 20:26:31,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:31,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:31,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:31,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:31,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:31,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:31,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:31,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:31,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:31,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:32,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:32,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-30 20:26:32,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 20:26:32,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 20:26:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:26:32,668 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-30 20:26:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:32,864 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-30 20:26:32,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:26:32,865 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-30 20:26:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:32,866 INFO L225 Difference]: With dead ends: 111 [2018-09-30 20:26:32,866 INFO L226 Difference]: Without dead ends: 110 [2018-09-30 20:26:32,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:26:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-30 20:26:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-30 20:26:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:26:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-30 20:26:32,872 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-30 20:26:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:32,872 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-30 20:26:32,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 20:26:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-30 20:26:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 20:26:32,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:32,873 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-30 20:26:32,873 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:32,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-30 20:26:32,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:32,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:32,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:32,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:32,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:33,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:33,387 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:33,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:33,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:33,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:33,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:33,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:33,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:33,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:33,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:34,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:34,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-30 20:26:34,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 20:26:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 20:26:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:34,055 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-30 20:26:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:34,263 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-30 20:26:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:26:34,263 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-30 20:26:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:34,265 INFO L225 Difference]: With dead ends: 115 [2018-09-30 20:26:34,265 INFO L226 Difference]: Without dead ends: 114 [2018-09-30 20:26:34,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:26:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-30 20:26:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-30 20:26:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 20:26:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-30 20:26:34,271 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-30 20:26:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:34,271 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-30 20:26:34,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 20:26:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-30 20:26:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-30 20:26:34,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:34,272 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-30 20:26:34,272 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:34,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-30 20:26:34,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:34,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:34,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:34,800 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:34,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:34,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 20:26:34,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:34,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:34,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:34,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:34,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:34,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:35,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:35,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-30 20:26:35,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 20:26:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 20:26:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:26:35,516 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-30 20:26:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:35,748 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-30 20:26:35,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:26:35,748 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-30 20:26:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:35,750 INFO L225 Difference]: With dead ends: 119 [2018-09-30 20:26:35,750 INFO L226 Difference]: Without dead ends: 118 [2018-09-30 20:26:35,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:26:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-30 20:26:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-30 20:26:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-30 20:26:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-30 20:26:35,755 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-30 20:26:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:35,756 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-30 20:26:35,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 20:26:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-30 20:26:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 20:26:35,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:35,756 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-30 20:26:35,756 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:35,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-30 20:26:35,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:35,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:35,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:35,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:35,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:36,525 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:36,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:36,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:36,570 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:36,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:36,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:36,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:36,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:36,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:36,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:37,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:37,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-30 20:26:37,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 20:26:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 20:26:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 20:26:37,250 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-30 20:26:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:37,451 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-30 20:26:37,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:26:37,451 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-30 20:26:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:37,452 INFO L225 Difference]: With dead ends: 123 [2018-09-30 20:26:37,453 INFO L226 Difference]: Without dead ends: 122 [2018-09-30 20:26:37,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 20:26:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-30 20:26:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-30 20:26:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 20:26:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-30 20:26:37,458 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-30 20:26:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:37,458 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-30 20:26:37,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 20:26:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-30 20:26:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-30 20:26:37,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:37,459 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-30 20:26:37,460 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:37,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-30 20:26:37,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:37,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:37,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:38,119 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:38,119 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:38,128 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:38,202 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 20:26:38,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:38,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:38,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:38,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:38,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:38,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:39,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:39,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-30 20:26:39,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 20:26:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 20:26:39,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:26:39,039 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-30 20:26:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:39,306 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-30 20:26:39,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:26:39,306 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-30 20:26:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:39,308 INFO L225 Difference]: With dead ends: 127 [2018-09-30 20:26:39,308 INFO L226 Difference]: Without dead ends: 126 [2018-09-30 20:26:39,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:26:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-30 20:26:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-30 20:26:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-30 20:26:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-30 20:26:39,313 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-30 20:26:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:39,314 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-30 20:26:39,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 20:26:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-30 20:26:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-30 20:26:39,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:39,314 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-30 20:26:39,314 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:39,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-30 20:26:39,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:39,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:39,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:40,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:40,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:40,333 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:40,428 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 20:26:40,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:40,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:40,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:40,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:40,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:40,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:41,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:41,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-30 20:26:41,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 20:26:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 20:26:41,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:26:41,434 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-30 20:26:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:41,634 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-30 20:26:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:26:41,635 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-30 20:26:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:41,636 INFO L225 Difference]: With dead ends: 131 [2018-09-30 20:26:41,636 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 20:26:41,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 20:26:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 20:26:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-30 20:26:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 20:26:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-30 20:26:41,641 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-30 20:26:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:41,641 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-30 20:26:41,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 20:26:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-30 20:26:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-30 20:26:41,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:41,642 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-30 20:26:41,642 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:41,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:41,642 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-30 20:26:41,643 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:41,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:41,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:41,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:41,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:42,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:42,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:42,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:42,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:42,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:42,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:42,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:42,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:43,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:43,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-30 20:26:43,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 20:26:43,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 20:26:43,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:26:43,335 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-30 20:26:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:43,536 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-30 20:26:43,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:26:43,537 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-30 20:26:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:43,538 INFO L225 Difference]: With dead ends: 135 [2018-09-30 20:26:43,539 INFO L226 Difference]: Without dead ends: 134 [2018-09-30 20:26:43,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:26:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-30 20:26:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-30 20:26:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-30 20:26:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-30 20:26:43,545 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-30 20:26:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:43,545 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-30 20:26:43,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 20:26:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-30 20:26:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-30 20:26:43,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:43,546 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-30 20:26:43,547 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:43,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:43,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-30 20:26:43,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:43,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:43,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:43,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:43,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:44,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:44,786 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:44,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:26:44,867 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:26:44,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:44,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:44,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:44,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:44,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:44,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:45,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:45,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-30 20:26:45,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 20:26:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 20:26:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:26:45,904 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-30 20:26:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:46,192 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-30 20:26:46,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 20:26:46,192 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-30 20:26:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:46,193 INFO L225 Difference]: With dead ends: 139 [2018-09-30 20:26:46,193 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 20:26:46,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:26:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 20:26:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-30 20:26:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-30 20:26:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-30 20:26:46,199 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-30 20:26:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:46,199 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-30 20:26:46,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 20:26:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-30 20:26:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 20:26:46,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:46,200 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-30 20:26:46,200 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:46,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-30 20:26:46,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:46,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:46,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:46,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:46,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:46,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:46,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:26:46,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 20:26:46,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:46,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:47,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:47,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:47,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:47,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:49,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:49,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-30 20:26:49,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 20:26:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 20:26:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:26:49,080 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-30 20:26:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:49,424 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-30 20:26:49,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 20:26:49,424 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-30 20:26:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:49,426 INFO L225 Difference]: With dead ends: 143 [2018-09-30 20:26:49,426 INFO L226 Difference]: Without dead ends: 142 [2018-09-30 20:26:49,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:26:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-30 20:26:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-30 20:26:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 20:26:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-30 20:26:49,431 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-30 20:26:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:49,432 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-30 20:26:49,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 20:26:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-30 20:26:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 20:26:49,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:49,433 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-30 20:26:49,433 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:49,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-30 20:26:49,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:49,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:49,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:50,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:50,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:50,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:26:50,210 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:26:50,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:50,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:50,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:50,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:50,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:50,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:51,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:51,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-30 20:26:51,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 20:26:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 20:26:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:26:51,191 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-30 20:26:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:51,590 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-30 20:26:51,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:26:51,591 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-30 20:26:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:51,592 INFO L225 Difference]: With dead ends: 147 [2018-09-30 20:26:51,592 INFO L226 Difference]: Without dead ends: 146 [2018-09-30 20:26:51,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:26:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-30 20:26:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-30 20:26:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-30 20:26:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-30 20:26:51,599 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-30 20:26:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:51,599 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-30 20:26:51,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 20:26:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-30 20:26:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-30 20:26:51,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:51,600 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-30 20:26:51,600 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-30 20:26:51,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:51,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:52,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:52,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:52,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:26:52,563 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 20:26:52,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:52,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:52,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:52,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:52,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:52,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:53,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:53,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-30 20:26:53,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 20:26:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 20:26:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:26:53,486 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-30 20:26:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:53,957 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-30 20:26:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:26:53,958 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-30 20:26:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:53,960 INFO L225 Difference]: With dead ends: 151 [2018-09-30 20:26:53,960 INFO L226 Difference]: Without dead ends: 150 [2018-09-30 20:26:53,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:26:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-30 20:26:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-30 20:26:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-30 20:26:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-30 20:26:53,966 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-30 20:26:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:53,966 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-30 20:26:53,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 20:26:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-30 20:26:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-30 20:26:53,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:53,968 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-30 20:26:53,968 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:53,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-30 20:26:53,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:53,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:54,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:54,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:54,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:26:55,286 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 20:26:55,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:26:55,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:55,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:55,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:55,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:56,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:56,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-30 20:26:56,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 20:26:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 20:26:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:26:56,344 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-30 20:26:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:56,678 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-30 20:26:56,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:26:56,679 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-30 20:26:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:56,681 INFO L225 Difference]: With dead ends: 155 [2018-09-30 20:26:56,681 INFO L226 Difference]: Without dead ends: 154 [2018-09-30 20:26:56,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 20:26:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-30 20:26:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-30 20:26:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-30 20:26:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-30 20:26:56,686 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-30 20:26:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:56,687 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-30 20:26:56,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 20:26:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-30 20:26:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-30 20:26:56,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:56,688 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-30 20:26:56,688 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:56,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-30 20:26:56,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:56,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:56,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:26:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:57,621 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:26:57,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:26:57,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:26:57,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:26:57,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:26:57,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:26:57,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:26:57,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:26:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:26:59,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:26:59,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-30 20:26:59,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 20:26:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 20:26:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:26:59,089 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-30 20:26:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:26:59,377 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-30 20:26:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:26:59,378 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-30 20:26:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:26:59,379 INFO L225 Difference]: With dead ends: 159 [2018-09-30 20:26:59,379 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 20:26:59,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:26:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 20:26:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-30 20:26:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 20:26:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-30 20:26:59,385 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-30 20:26:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:26:59,385 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-30 20:26:59,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 20:26:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-30 20:26:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-30 20:26:59,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:26:59,387 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-30 20:26:59,387 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:26:59,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:26:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-30 20:26:59,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:26:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:26:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:59,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:26:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:26:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:00,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:00,578 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:00,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:00,634 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:00,634 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:00,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:00,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:00,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:00,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:01,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:01,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-30 20:27:01,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 20:27:01,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 20:27:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:27:01,930 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-30 20:27:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:02,276 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-30 20:27:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:27:02,276 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-30 20:27:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:02,278 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:27:02,278 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 20:27:02,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 20:27:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 20:27:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-30 20:27:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 20:27:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-30 20:27:02,283 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-30 20:27:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:02,284 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-30 20:27:02,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 20:27:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-30 20:27:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 20:27:02,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:02,285 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-30 20:27:02,285 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:02,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-30 20:27:02,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:02,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:02,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:02,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:02,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:03,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:03,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:03,734 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 20:27:03,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:03,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:03,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:03,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:03,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:03,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:04,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:04,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-30 20:27:04,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 20:27:04,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 20:27:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:27:04,807 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-30 20:27:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:05,352 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-30 20:27:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 20:27:05,352 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-30 20:27:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:05,353 INFO L225 Difference]: With dead ends: 167 [2018-09-30 20:27:05,354 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 20:27:05,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:27:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 20:27:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-30 20:27:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-30 20:27:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-30 20:27:05,360 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-30 20:27:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:05,360 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-30 20:27:05,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 20:27:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-30 20:27:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-30 20:27:05,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:05,361 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-30 20:27:05,361 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:05,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-30 20:27:05,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:05,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:07,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:07,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:07,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:07,500 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:07,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:07,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:07,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:07,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:07,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:07,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:08,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:08,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-30 20:27:08,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 20:27:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 20:27:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:27:08,782 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-30 20:27:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:09,067 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-30 20:27:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:27:09,067 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-30 20:27:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:09,068 INFO L225 Difference]: With dead ends: 171 [2018-09-30 20:27:09,068 INFO L226 Difference]: Without dead ends: 170 [2018-09-30 20:27:09,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:27:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-30 20:27:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-30 20:27:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-30 20:27:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-30 20:27:09,074 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-30 20:27:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:09,074 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-30 20:27:09,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 20:27:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-30 20:27:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-30 20:27:09,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:09,075 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-30 20:27:09,076 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:09,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-30 20:27:09,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:09,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:10,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:10,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:10,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:10,710 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 20:27:10,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:10,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:10,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:10,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:10,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:10,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:12,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:12,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-30 20:27:12,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 20:27:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 20:27:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:27:12,219 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-30 20:27:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:12,545 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-30 20:27:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:27:12,546 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-30 20:27:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:12,547 INFO L225 Difference]: With dead ends: 175 [2018-09-30 20:27:12,547 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 20:27:12,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:27:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 20:27:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-30 20:27:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 20:27:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-30 20:27:12,554 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-30 20:27:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:12,554 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-30 20:27:12,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 20:27:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-30 20:27:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-30 20:27:12,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:12,555 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-30 20:27:12,555 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:12,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-30 20:27:12,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:12,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:12,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:13,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:13,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:13,717 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:13,923 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 20:27:13,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:13,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:13,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:13,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:13,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:13,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:15,189 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:15,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-30 20:27:15,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 20:27:15,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 20:27:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:27:15,191 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-30 20:27:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:15,805 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-30 20:27:15,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 20:27:15,805 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-30 20:27:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:15,807 INFO L225 Difference]: With dead ends: 179 [2018-09-30 20:27:15,807 INFO L226 Difference]: Without dead ends: 178 [2018-09-30 20:27:15,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 20:27:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-30 20:27:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-30 20:27:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 20:27:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-30 20:27:15,812 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-30 20:27:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:15,812 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-30 20:27:15,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 20:27:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-30 20:27:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 20:27:15,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:15,813 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-30 20:27:15,814 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:15,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-30 20:27:15,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:15,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:15,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:15,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:15,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:17,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:17,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:17,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:17,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:17,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:17,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:17,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:18,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:18,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-30 20:27:18,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 20:27:18,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 20:27:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 20:27:18,574 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-30 20:27:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:18,863 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-30 20:27:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 20:27:18,864 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-30 20:27:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:18,865 INFO L225 Difference]: With dead ends: 183 [2018-09-30 20:27:18,865 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 20:27:18,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 20:27:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 20:27:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-30 20:27:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 20:27:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-30 20:27:18,869 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-30 20:27:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:18,869 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-30 20:27:18,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 20:27:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-30 20:27:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-30 20:27:18,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:18,870 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-30 20:27:18,870 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:18,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-30 20:27:18,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:18,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:18,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:20,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:20,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:20,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:20,131 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:20,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:20,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:20,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:20,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:20,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:20,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:21,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:21,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-30 20:27:21,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 20:27:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 20:27:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:27:21,494 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-30 20:27:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:21,825 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-30 20:27:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 20:27:21,825 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-30 20:27:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:21,826 INFO L225 Difference]: With dead ends: 187 [2018-09-30 20:27:21,826 INFO L226 Difference]: Without dead ends: 186 [2018-09-30 20:27:21,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:27:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-30 20:27:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-30 20:27:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-30 20:27:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-30 20:27:21,832 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-30 20:27:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:21,832 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-30 20:27:21,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 20:27:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-30 20:27:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-30 20:27:21,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:21,833 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-30 20:27:21,834 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:21,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-30 20:27:21,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:21,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:21,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:23,069 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:23,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:23,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:23,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 20:27:23,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:23,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:23,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:23,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:23,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:23,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:24,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:24,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-30 20:27:24,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 20:27:24,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 20:27:24,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:27:24,621 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-30 20:27:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:24,941 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-30 20:27:24,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:27:24,941 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-30 20:27:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:24,943 INFO L225 Difference]: With dead ends: 191 [2018-09-30 20:27:24,943 INFO L226 Difference]: Without dead ends: 190 [2018-09-30 20:27:24,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:27:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-30 20:27:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-30 20:27:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-30 20:27:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-30 20:27:24,949 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-30 20:27:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:24,950 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-30 20:27:24,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 20:27:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-30 20:27:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 20:27:24,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:24,951 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-30 20:27:24,951 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:24,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-30 20:27:24,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:24,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:24,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:24,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:26,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:26,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:26,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:26,411 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:26,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:26,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:26,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:26,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:26,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:26,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:29,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:29,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-30 20:27:29,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 20:27:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 20:27:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:27:29,340 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-30 20:27:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:29,815 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-30 20:27:29,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:27:29,816 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-30 20:27:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:29,817 INFO L225 Difference]: With dead ends: 195 [2018-09-30 20:27:29,817 INFO L226 Difference]: Without dead ends: 194 [2018-09-30 20:27:29,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:27:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-30 20:27:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-30 20:27:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-30 20:27:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-30 20:27:29,824 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-30 20:27:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:29,824 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-30 20:27:29,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 20:27:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-30 20:27:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-30 20:27:29,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:29,825 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-30 20:27:29,826 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:29,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-30 20:27:29,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:29,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:29,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:29,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:29,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:31,737 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:31,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:31,877 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 20:27:31,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:31,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:31,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:31,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:31,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:32,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:33,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:33,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-30 20:27:33,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 20:27:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 20:27:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:27:33,703 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-30 20:27:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:34,111 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-30 20:27:34,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:27:34,111 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-30 20:27:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:34,113 INFO L225 Difference]: With dead ends: 199 [2018-09-30 20:27:34,113 INFO L226 Difference]: Without dead ends: 198 [2018-09-30 20:27:34,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:27:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-30 20:27:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-30 20:27:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 20:27:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-30 20:27:34,120 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-30 20:27:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:34,120 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-30 20:27:34,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 20:27:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-30 20:27:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 20:27:34,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:34,122 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-30 20:27:34,122 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:34,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-30 20:27:34,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:34,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:35,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:35,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:35,568 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:35,734 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 20:27:35,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:35,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:35,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:35,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:35,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:35,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:37,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:37,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-30 20:27:37,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 20:27:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 20:27:37,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:27:37,378 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-30 20:27:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:37,772 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-30 20:27:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:27:37,773 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-30 20:27:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:37,774 INFO L225 Difference]: With dead ends: 203 [2018-09-30 20:27:37,775 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 20:27:37,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:27:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 20:27:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-30 20:27:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 20:27:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-30 20:27:37,780 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-30 20:27:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:37,781 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-30 20:27:37,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 20:27:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-30 20:27:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-30 20:27:37,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:37,782 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-30 20:27:37,782 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:37,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-30 20:27:37,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:37,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:39,214 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:39,214 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:39,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:39,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:39,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:39,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:39,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:39,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:40,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:40,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-30 20:27:40,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 20:27:40,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 20:27:40,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:27:40,832 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-30 20:27:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:41,169 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-30 20:27:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 20:27:41,169 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-30 20:27:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:41,171 INFO L225 Difference]: With dead ends: 207 [2018-09-30 20:27:41,171 INFO L226 Difference]: Without dead ends: 206 [2018-09-30 20:27:41,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:27:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-30 20:27:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-30 20:27:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-30 20:27:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-30 20:27:41,178 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-30 20:27:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:41,179 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-30 20:27:41,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 20:27:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-30 20:27:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-30 20:27:41,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:41,180 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-30 20:27:41,180 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:41,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:41,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-30 20:27:41,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:41,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:41,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:27:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:42,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:42,912 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:42,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:27:42,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:27:42,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:42,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:42,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:42,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:42,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:42,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:44,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:44,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-30 20:27:44,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 20:27:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 20:27:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:27:44,932 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-30 20:27:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:45,267 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-30 20:27:45,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 20:27:45,267 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-30 20:27:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:45,269 INFO L225 Difference]: With dead ends: 211 [2018-09-30 20:27:45,270 INFO L226 Difference]: Without dead ends: 210 [2018-09-30 20:27:45,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 20:27:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-30 20:27:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-30 20:27:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-30 20:27:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-30 20:27:45,276 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-30 20:27:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:45,276 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-30 20:27:45,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 20:27:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-30 20:27:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-30 20:27:45,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:45,278 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-30 20:27:45,278 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:45,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-30 20:27:45,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:45,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:45,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:46,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:46,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:27:47,245 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 20:27:47,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:47,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:47,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:47,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:47,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:47,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:49,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:49,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-30 20:27:49,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 20:27:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 20:27:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:27:49,248 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-30 20:27:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:49,593 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-30 20:27:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:27:49,594 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-30 20:27:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:49,595 INFO L225 Difference]: With dead ends: 215 [2018-09-30 20:27:49,596 INFO L226 Difference]: Without dead ends: 214 [2018-09-30 20:27:49,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:27:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-30 20:27:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-30 20:27:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 20:27:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-30 20:27:49,602 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-30 20:27:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:49,602 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-30 20:27:49,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 20:27:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-30 20:27:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-30 20:27:49,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:49,603 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-30 20:27:49,604 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:49,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-30 20:27:49,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:49,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:49,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:49,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:49,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:51,090 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:51,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:51,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:27:51,161 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:27:51,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:51,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:51,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:51,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:51,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:51,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:53,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:53,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-30 20:27:53,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 20:27:53,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 20:27:53,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:27:53,173 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-30 20:27:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:53,520 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-30 20:27:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 20:27:53,520 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-30 20:27:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:53,522 INFO L225 Difference]: With dead ends: 219 [2018-09-30 20:27:53,522 INFO L226 Difference]: Without dead ends: 218 [2018-09-30 20:27:53,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:27:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-30 20:27:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-30 20:27:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-30 20:27:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-30 20:27:53,527 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-30 20:27:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:53,527 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-30 20:27:53,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 20:27:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-30 20:27:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-30 20:27:53,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:53,528 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-30 20:27:53,529 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:53,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-30 20:27:53,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:53,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:53,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:55,092 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:55,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:27:55,100 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:27:55,250 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 20:27:55,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:55,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:55,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:55,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:55,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:55,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:27:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:57,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:27:57,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-30 20:27:57,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 20:27:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 20:27:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:27:57,078 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-30 20:27:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:27:57,452 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-30 20:27:57,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:27:57,453 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-30 20:27:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:27:57,454 INFO L225 Difference]: With dead ends: 223 [2018-09-30 20:27:57,455 INFO L226 Difference]: Without dead ends: 222 [2018-09-30 20:27:57,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:27:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-30 20:27:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-30 20:27:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-30 20:27:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-30 20:27:57,460 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-30 20:27:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:27:57,460 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-30 20:27:57,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 20:27:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-30 20:27:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-30 20:27:57,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:27:57,461 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-30 20:27:57,462 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:27:57,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:27:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-30 20:27:57,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:27:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:27:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:57,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:27:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:27:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:27:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:27:59,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:27:59,191 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-09-30 20:27:59,199 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:27:59,414 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 20:27:59,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:27:59,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:27:59,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:27:59,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:27:59,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:27:59,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:01,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:01,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-30 20:28:01,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 20:28:01,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 20:28:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:28:01,326 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-30 20:28:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:01,679 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-30 20:28:01,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:28:01,679 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-30 20:28:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:01,680 INFO L225 Difference]: With dead ends: 227 [2018-09-30 20:28:01,680 INFO L226 Difference]: Without dead ends: 226 [2018-09-30 20:28:01,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 20:28:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-30 20:28:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-30 20:28:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-30 20:28:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-30 20:28:01,686 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-30 20:28:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:01,687 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-30 20:28:01,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 20:28:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-30 20:28:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-30 20:28:01,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:01,688 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-30 20:28:01,688 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:01,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-30 20:28:01,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:01,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:01,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:01,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:01,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:03,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:03,546 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-09-30 20:28:03,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:03,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:03,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:03,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:03,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:03,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:05,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:05,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-30 20:28:05,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 20:28:05,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 20:28:05,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:28:05,578 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-30 20:28:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:05,975 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-30 20:28:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 20:28:05,976 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-30 20:28:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:05,978 INFO L225 Difference]: With dead ends: 231 [2018-09-30 20:28:05,978 INFO L226 Difference]: Without dead ends: 230 [2018-09-30 20:28:05,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:28:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-30 20:28:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-30 20:28:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-30 20:28:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-30 20:28:05,986 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-30 20:28:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:05,986 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-30 20:28:05,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 20:28:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-30 20:28:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-30 20:28:05,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:05,988 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-30 20:28:05,988 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:05,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-30 20:28:05,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:05,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:05,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:05,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:07,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:07,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 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-09-30 20:28:07,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:07,786 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:07,786 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:07,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:07,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:07,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:07,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:07,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:10,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:10,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-30 20:28:10,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 20:28:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 20:28:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:28:10,474 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-30 20:28:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:10,899 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-30 20:28:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:28:10,900 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-30 20:28:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:10,901 INFO L225 Difference]: With dead ends: 235 [2018-09-30 20:28:10,901 INFO L226 Difference]: Without dead ends: 234 [2018-09-30 20:28:10,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:28:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-30 20:28:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-30 20:28:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-30 20:28:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-30 20:28:10,907 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-30 20:28:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:10,907 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-30 20:28:10,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 20:28:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-30 20:28:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-30 20:28:10,909 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:10,909 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-30 20:28:10,909 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:10,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-30 20:28:10,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:10,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:12,625 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:12,625 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-09-30 20:28:12,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:12,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 20:28:12,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:12,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:12,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:12,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:12,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:15,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:15,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-30 20:28:15,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 20:28:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 20:28:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:28:15,386 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-30 20:28:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:15,811 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-30 20:28:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 20:28:15,811 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-30 20:28:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:15,813 INFO L225 Difference]: With dead ends: 239 [2018-09-30 20:28:15,813 INFO L226 Difference]: Without dead ends: 238 [2018-09-30 20:28:15,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:28:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-30 20:28:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-30 20:28:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 20:28:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-30 20:28:15,818 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-30 20:28:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:15,818 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-30 20:28:15,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 20:28:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-30 20:28:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-30 20:28:15,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:15,819 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-30 20:28:15,820 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:15,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-30 20:28:15,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:15,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:15,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:17,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:17,575 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-09-30 20:28:17,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:17,662 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:17,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:17,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:17,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:17,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:17,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:17,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:19,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:20,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-30 20:28:20,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 20:28:20,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 20:28:20,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 20:28:20,002 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-30 20:28:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:20,457 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-30 20:28:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 20:28:20,457 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-30 20:28:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:20,459 INFO L225 Difference]: With dead ends: 243 [2018-09-30 20:28:20,459 INFO L226 Difference]: Without dead ends: 242 [2018-09-30 20:28:20,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 20:28:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-30 20:28:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-30 20:28:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-30 20:28:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-30 20:28:20,464 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-30 20:28:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:20,465 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-30 20:28:20,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 20:28:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-30 20:28:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-30 20:28:20,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:20,466 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-30 20:28:20,466 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:20,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-30 20:28:20,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:20,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:20,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:20,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:22,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:22,289 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-09-30 20:28:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:22,467 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 20:28:22,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:22,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:22,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:22,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:22,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:22,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:24,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:24,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-30 20:28:24,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 20:28:24,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 20:28:24,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:28:24,891 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-30 20:28:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:25,288 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-30 20:28:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 20:28:25,289 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-30 20:28:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:25,290 INFO L225 Difference]: With dead ends: 247 [2018-09-30 20:28:25,290 INFO L226 Difference]: Without dead ends: 246 [2018-09-30 20:28:25,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 20:28:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-30 20:28:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-30 20:28:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 20:28:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-30 20:28:25,296 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-30 20:28:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:25,296 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-30 20:28:25,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 20:28:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-30 20:28:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-30 20:28:25,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:25,297 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-30 20:28:25,298 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:25,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:25,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-30 20:28:25,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:25,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:25,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:25,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:27,129 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:27,129 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-09-30 20:28:27,140 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:28:27,519 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-30 20:28:27,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:27,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:27,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:27,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:27,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:27,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:30,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:30,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-30 20:28:30,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 20:28:30,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 20:28:30,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:28:30,055 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-30 20:28:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:30,549 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-30 20:28:30,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 20:28:30,550 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-30 20:28:30,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:30,551 INFO L225 Difference]: With dead ends: 251 [2018-09-30 20:28:30,551 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 20:28:30,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 20:28:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 20:28:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-30 20:28:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-30 20:28:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-30 20:28:30,559 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-30 20:28:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:30,559 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-30 20:28:30,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-30 20:28:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-30 20:28:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-30 20:28:30,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:30,561 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-30 20:28:30,561 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:30,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-30 20:28:30,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:30,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:30,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:32,476 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:32,476 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-09-30 20:28:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:32,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:32,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:32,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:32,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:32,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:35,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:35,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-30 20:28:35,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-30 20:28:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-30 20:28:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 20:28:35,167 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-30 20:28:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:35,618 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-30 20:28:35,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 20:28:35,619 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-30 20:28:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:35,620 INFO L225 Difference]: With dead ends: 255 [2018-09-30 20:28:35,620 INFO L226 Difference]: Without dead ends: 254 [2018-09-30 20:28:35,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 20:28:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-30 20:28:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-30 20:28:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-30 20:28:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-30 20:28:35,625 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-30 20:28:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:35,625 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-30 20:28:35,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-30 20:28:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-30 20:28:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-30 20:28:35,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:35,626 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-30 20:28:35,626 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:35,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:35,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-30 20:28:35,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:35,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:28:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:37,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:37,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 20:28:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:28:37,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:28:37,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:37,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:37,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:37,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:37,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:37,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:40,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:40,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-30 20:28:40,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-30 20:28:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-30 20:28:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 20:28:40,303 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-30 20:28:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:40,754 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-30 20:28:40,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 20:28:40,755 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-30 20:28:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:40,756 INFO L225 Difference]: With dead ends: 259 [2018-09-30 20:28:40,756 INFO L226 Difference]: Without dead ends: 258 [2018-09-30 20:28:40,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 20:28:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-30 20:28:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-30 20:28:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 20:28:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-30 20:28:40,762 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-30 20:28:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:40,762 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-30 20:28:40,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-30 20:28:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-30 20:28:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-30 20:28:40,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:40,763 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-30 20:28:40,764 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:40,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-30 20:28:40,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:40,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:42,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:42,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 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-09-30 20:28:42,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:28:43,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-30 20:28:43,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:43,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:43,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:43,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:43,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:43,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:45,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:45,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-30 20:28:45,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-30 20:28:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-30 20:28:45,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 20:28:45,849 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-30 20:28:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:46,324 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-30 20:28:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 20:28:46,325 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-30 20:28:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:46,326 INFO L225 Difference]: With dead ends: 263 [2018-09-30 20:28:46,326 INFO L226 Difference]: Without dead ends: 262 [2018-09-30 20:28:46,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 20:28:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-30 20:28:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-30 20:28:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-30 20:28:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-30 20:28:46,332 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-30 20:28:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:46,333 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-30 20:28:46,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-30 20:28:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-30 20:28:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-30 20:28:46,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:46,334 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-30 20:28:46,335 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:46,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-30 20:28:46,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:46,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:46,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:48,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:48,480 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-09-30 20:28:48,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:28:48,572 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:28:48,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:48,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:48,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:48,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:48,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:48,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:51,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:51,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-30 20:28:51,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-30 20:28:51,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-30 20:28:51,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:28:51,682 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-30 20:28:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:52,175 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-30 20:28:52,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 20:28:52,175 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-30 20:28:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:52,177 INFO L225 Difference]: With dead ends: 267 [2018-09-30 20:28:52,177 INFO L226 Difference]: Without dead ends: 266 [2018-09-30 20:28:52,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:28:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-30 20:28:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-30 20:28:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-30 20:28:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-30 20:28:52,184 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-30 20:28:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:52,184 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-30 20:28:52,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-30 20:28:52,185 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-30 20:28:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-30 20:28:52,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:52,186 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-30 20:28:52,186 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:52,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-30 20:28:52,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:52,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:52,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:52,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:28:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:54,722 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:28:54,723 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-09-30 20:28:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:28:54,937 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-30 20:28:54,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:28:54,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:28:54,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:28:54,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:28:54,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:28:54,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:28:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:28:57,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:28:57,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-30 20:28:57,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-30 20:28:57,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-30 20:28:57,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 20:28:57,551 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-30 20:28:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:28:58,051 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-30 20:28:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-30 20:28:58,052 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-30 20:28:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:28:58,054 INFO L225 Difference]: With dead ends: 271 [2018-09-30 20:28:58,054 INFO L226 Difference]: Without dead ends: 270 [2018-09-30 20:28:58,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 20:28:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-30 20:28:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-30 20:28:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-30 20:28:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-30 20:28:58,061 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-30 20:28:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:28:58,061 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-30 20:28:58,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-30 20:28:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-30 20:28:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-30 20:28:58,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:28:58,063 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-30 20:28:58,063 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:28:58,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:28:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-30 20:28:58,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:28:58,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:28:58,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:58,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:28:58,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:28:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:00,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:00,574 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-09-30 20:29:00,581 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:29:00,899 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-30 20:29:00,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:00,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:00,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:00,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:00,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:00,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:03,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:03,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-30 20:29:03,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-30 20:29:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-30 20:29:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 20:29:03,645 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-30 20:29:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:04,241 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-30 20:29:04,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 20:29:04,241 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-30 20:29:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:04,243 INFO L225 Difference]: With dead ends: 275 [2018-09-30 20:29:04,243 INFO L226 Difference]: Without dead ends: 274 [2018-09-30 20:29:04,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 20:29:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-30 20:29:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-30 20:29:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-30 20:29:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-30 20:29:04,249 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-30 20:29:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:04,249 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-30 20:29:04,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-30 20:29:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-30 20:29:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-30 20:29:04,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:04,250 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-30 20:29:04,250 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:04,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:04,251 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-30 20:29:04,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:04,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:04,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:06,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:06,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 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-09-30 20:29:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:06,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:06,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:06,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:06,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:06,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:09,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:09,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-30 20:29:09,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-30 20:29:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-30 20:29:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-30 20:29:09,759 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-30 20:29:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:10,205 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-30 20:29:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-30 20:29:10,205 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-30 20:29:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:10,206 INFO L225 Difference]: With dead ends: 279 [2018-09-30 20:29:10,206 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 20:29:10,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-30 20:29:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 20:29:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-30 20:29:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-30 20:29:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-30 20:29:10,213 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-30 20:29:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:10,213 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-30 20:29:10,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-30 20:29:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-30 20:29:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-30 20:29:10,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:10,215 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-30 20:29:10,215 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:10,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-30 20:29:10,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:10,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:12,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:12,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 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-09-30 20:29:12,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:29:12,677 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:29:12,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:12,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:12,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:12,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:12,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:12,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:15,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:15,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-30 20:29:15,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-30 20:29:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-30 20:29:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 20:29:15,745 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-30 20:29:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:16,263 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-30 20:29:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-30 20:29:16,264 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-30 20:29:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:16,266 INFO L225 Difference]: With dead ends: 283 [2018-09-30 20:29:16,266 INFO L226 Difference]: Without dead ends: 282 [2018-09-30 20:29:16,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 20:29:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-30 20:29:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-30 20:29:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-30 20:29:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-30 20:29:16,273 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-30 20:29:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:16,274 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-30 20:29:16,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-30 20:29:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-30 20:29:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-30 20:29:16,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:16,276 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-30 20:29:16,276 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:16,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-30 20:29:16,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:16,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:18,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:18,668 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-09-30 20:29:18,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:29:19,060 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-30 20:29:19,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:19,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:19,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:19,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:19,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:19,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:22,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:22,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-30 20:29:22,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-30 20:29:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-30 20:29:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 20:29:22,143 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-30 20:29:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:22,636 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-30 20:29:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 20:29:22,636 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-30 20:29:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:22,638 INFO L225 Difference]: With dead ends: 287 [2018-09-30 20:29:22,638 INFO L226 Difference]: Without dead ends: 286 [2018-09-30 20:29:22,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 20:29:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-30 20:29:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-30 20:29:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-30 20:29:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-30 20:29:22,646 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-30 20:29:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:22,646 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-30 20:29:22,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-30 20:29:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-30 20:29:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-30 20:29:22,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:22,648 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-30 20:29:22,648 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:22,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-30 20:29:22,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:22,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:22,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:22,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:25,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:25,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 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-09-30 20:29:25,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:29:25,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:29:25,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:25,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:25,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:25,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:25,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:25,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:28,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:28,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-30 20:29:28,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-30 20:29:28,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-30 20:29:28,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-30 20:29:28,502 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-30 20:29:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:29,103 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-30 20:29:29,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 20:29:29,104 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-30 20:29:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:29,106 INFO L225 Difference]: With dead ends: 291 [2018-09-30 20:29:29,106 INFO L226 Difference]: Without dead ends: 290 [2018-09-30 20:29:29,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-30 20:29:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-30 20:29:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-30 20:29:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-30 20:29:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-30 20:29:29,111 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-30 20:29:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:29,112 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-30 20:29:29,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-30 20:29:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-30 20:29:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-30 20:29:29,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:29,113 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-30 20:29:29,113 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:29,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-30 20:29:29,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:29,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:29,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:29,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:31,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:31,842 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-09-30 20:29:31,849 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:29:32,093 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-30 20:29:32,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:32,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:32,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:32,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:32,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:32,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:35,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:35,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-30 20:29:35,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-30 20:29:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-30 20:29:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 20:29:35,205 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-30 20:29:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:35,759 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-30 20:29:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-30 20:29:35,759 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-30 20:29:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:35,761 INFO L225 Difference]: With dead ends: 295 [2018-09-30 20:29:35,761 INFO L226 Difference]: Without dead ends: 294 [2018-09-30 20:29:35,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 20:29:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-30 20:29:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-30 20:29:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-30 20:29:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-30 20:29:35,766 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-30 20:29:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:35,767 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-30 20:29:35,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-30 20:29:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-30 20:29:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-30 20:29:35,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:35,769 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-30 20:29:35,769 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:35,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-30 20:29:35,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:35,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:38,343 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:38,343 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-09-30 20:29:38,350 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:29:38,728 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-30 20:29:38,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:38,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:38,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:38,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:38,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:38,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:41,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:41,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-30 20:29:41,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-30 20:29:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-30 20:29:41,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 20:29:41,965 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-30 20:29:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:42,463 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-30 20:29:42,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 20:29:42,464 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-30 20:29:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:42,465 INFO L225 Difference]: With dead ends: 299 [2018-09-30 20:29:42,465 INFO L226 Difference]: Without dead ends: 298 [2018-09-30 20:29:42,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 20:29:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-30 20:29:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-30 20:29:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-30 20:29:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-30 20:29:42,471 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-30 20:29:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:42,472 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-30 20:29:42,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-30 20:29:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-30 20:29:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-30 20:29:42,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:42,473 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-30 20:29:42,473 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:42,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:42,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-30 20:29:42,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:42,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:45,324 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:45,324 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-09-30 20:29:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:45,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:45,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:45,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:45,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:45,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:48,677 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:48,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-30 20:29:48,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-30 20:29:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-30 20:29:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 20:29:48,680 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-30 20:29:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:49,165 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-30 20:29:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-30 20:29:49,166 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-30 20:29:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:49,167 INFO L225 Difference]: With dead ends: 303 [2018-09-30 20:29:49,167 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 20:29:49,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 20:29:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 20:29:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-30 20:29:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 20:29:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-30 20:29:49,172 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-30 20:29:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:49,172 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-30 20:29:49,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-30 20:29:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-30 20:29:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-30 20:29:49,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:49,173 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-30 20:29:49,174 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:49,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-30 20:29:49,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:49,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:49,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:29:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:51,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:51,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 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-09-30 20:29:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:29:51,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:29:51,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:51,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:52,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:52,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:52,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:52,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 20:29:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:55,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:29:55,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-30 20:29:55,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-30 20:29:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-30 20:29:55,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 20:29:55,250 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-30 20:29:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:29:55,836 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-30 20:29:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 20:29:55,836 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-30 20:29:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:29:55,838 INFO L225 Difference]: With dead ends: 307 [2018-09-30 20:29:55,838 INFO L226 Difference]: Without dead ends: 306 [2018-09-30 20:29:55,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 20:29:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-30 20:29:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-30 20:29:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-30 20:29:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-30 20:29:55,844 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-30 20:29:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:29:55,844 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-30 20:29:55,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-30 20:29:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-30 20:29:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-30 20:29:55,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:29:55,846 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-30 20:29:55,846 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:29:55,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:29:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-30 20:29:55,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:29:55,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:29:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:55,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:29:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:29:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:29:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:29:58,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:29:58,622 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-09-30 20:29:58,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:29:59,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-30 20:29:59,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:29:59,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:29:59,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-30 20:29:59,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:29:59,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:29:59,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-30 20:30:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:30:02,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:30:02,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-30 20:30:02,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-30 20:30:02,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-30 20:30:02,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-30 20:30:02,491 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-30 20:30:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-30 20:30:02,492 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:30:02,612 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:30:02,612 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:30:02 BoogieIcfgContainer [2018-09-30 20:30:02,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:30:02,614 INFO L168 Benchmark]: Toolchain (without parser) took 238158.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -828.7 MB). Peak memory consumption was 645.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:30:02,615 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:30:02,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:30:02,616 INFO L168 Benchmark]: Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:30:02,616 INFO L168 Benchmark]: RCFGBuilder took 278.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:30:02,616 INFO L168 Benchmark]: TraceAbstraction took 237787.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -849.9 MB). Peak memory consumption was 624.2 MB. Max. memory is 7.1 GB. [2018-09-30 20:30:02,618 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 278.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237787.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 797.4 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -849.9 MB). Peak memory consumption was 624.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and FLOYD_HOARE automaton (currently 2 states, 154 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 237.6s OverallTime, 76 OverallIterations, 76 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 4157 SDslu, 4209 SDs, 0 SdLazy, 15681 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 184.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=75, 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: 0.3s AutomataMinimizationTime, 75 MinimizatonAttempts, 75 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 9.3s SatisfiabilityAnalysisTime, 197.1s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 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/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-30-02-627.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-30-02-627.csv Completed graceful shutdown