java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:54:55,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:54:55,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:54:55,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:54:55,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:54:55,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:54:55,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:54:55,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:54:55,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:54:55,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:54:55,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:54:55,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:54:55,486 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:54:55,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:54:55,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:54:55,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:54:55,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:54:55,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:54:55,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:54:55,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:54:55,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:54:55,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:54:55,500 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:54:55,500 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:54:55,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:54:55,501 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:54:55,502 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:54:55,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:54:55,504 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:54:55,505 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:54:55,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:54:55,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:54:55,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:54:55,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:54:55,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:54:55,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:54:55,510 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:54:55,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:54:55,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:54:55,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:54:55,540 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:54:55,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:54:55,542 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:54:55,542 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:54:55,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:54:55,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:54:55,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:54:55,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:54:55,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:54:55,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:54:55,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:54:55,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:54:55,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:54:55,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:54:55,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:54:55,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:54:55,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:54:55,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:54:55,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:54:55,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:54:55,546 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:54:55,546 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:54:55,546 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:54:55,546 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:54:55,547 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:54:55,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:54:55,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:54:55,547 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:54:55,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:54:55,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:54:55,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:54:55,617 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:54:55,618 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:54:55,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl [2018-10-04 12:54:55,619 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl' [2018-10-04 12:54:55,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:54:55,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:54:55,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:54:55,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:54:55,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:54:55,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,709 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:54:55,709 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:54:55,710 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:54:55,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:54:55,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:54:55,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:54:55,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:54:55,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... [2018-10-04 12:54:55,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:54:55,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:54:55,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:54:55,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:54:55,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:54:55,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:54:55,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:54:55,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:54:55,970 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:54:55,970 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:54:55 BoogieIcfgContainer [2018-10-04 12:54:55,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:54:55,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:54:55,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:54:55,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:54:55,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:54:55" (1/2) ... [2018-10-04 12:54:55,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a27b009 and model type HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:54:55, skipping insertion in model container [2018-10-04 12:54:55,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:54:55" (2/2) ... [2018-10-04 12:54:55,978 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEquality-Safe.bpl [2018-10-04 12:54:55,988 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:54:56,000 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:54:56,057 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:54:56,058 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:54:56,058 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:54:56,058 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:54:56,058 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:54:56,059 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:54:56,059 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:54:56,059 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:54:56,059 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:54:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 12:54:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 12:54:56,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:56,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 12:54:56,092 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:56,099 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 12:54:56,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:56,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:56,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:54:56,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:54:56,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:54:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:54:56,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:56,258 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 12:54:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:56,313 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:54:56,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:54:56,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 12:54:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:56,325 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:54:56,325 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 12:54:56,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:54:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 12:54:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 12:54:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 12:54:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 12:54:56,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 12:54:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:56,362 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 12:54:56,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:54:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 12:54:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:54:56,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:56,363 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:54:56,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:56,364 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 12:54:56,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:56,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:56,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:56,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:56,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:56,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:56,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:56,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:56,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-04 12:54:56,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:54:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:54:56,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:56,643 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-04 12:54:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:56,667 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 12:54:56,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:54:56,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-04 12:54:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:56,669 INFO L225 Difference]: With dead ends: 6 [2018-10-04 12:54:56,669 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:54:56,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 12:54:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:54:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:54:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:54:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:54:56,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:54:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:56,672 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:54:56,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:54:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:54:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:54:56,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:56,673 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 12:54:56,674 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:56,674 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 12:54:56,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:56,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:56,769 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:56,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:56,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:56,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:56,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:56,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:56,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:54:56,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:54:56,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:54:56,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:56,843 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-04 12:54:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:56,880 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 12:54:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:54:56,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 12:54:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:56,881 INFO L225 Difference]: With dead ends: 7 [2018-10-04 12:54:56,881 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:54:56,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:54:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:54:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:54:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:54:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:54:56,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:54:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:56,885 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:54:56,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:54:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:54:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:54:56,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:56,886 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 12:54:56,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:56,886 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 12:54:56,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:57,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:57,011 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:57,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:57,035 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:54:57,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:57,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:57,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:57,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:54:57,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:54:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:54:57,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:57,121 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-04 12:54:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:57,150 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:54:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:54:57,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 12:54:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:57,151 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:54:57,151 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:54:57,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 12:54:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:54:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:54:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:54:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:54:57,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:54:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:57,155 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:54:57,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:54:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:54:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:54:57,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:57,155 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 12:54:57,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:57,156 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 12:54:57,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:57,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:57,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:57,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:57,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:57,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:57,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:57,448 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:57,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:57,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:57,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:57,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:54:57,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:54:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:54:57,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:57,527 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-04 12:54:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:57,559 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:54:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:54:57,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 12:54:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:57,560 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:54:57,560 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:54:57,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 12:54:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:54:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:54:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:54:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:54:57,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:54:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:57,563 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:54:57,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:54:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:54:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:54:57,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:57,564 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 12:54:57,565 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:57,565 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:57,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 12:54:57,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:57,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:57,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:57,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:57,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:57,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:57,724 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:57,732 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:57,808 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:54:57,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:57,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:57,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:57,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:54:57,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:54:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:54:57,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:57,893 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-04 12:54:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:57,942 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:54:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:54:57,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 12:54:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:57,943 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:54:57,944 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:54:57,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 6 [2018-10-04 12:54:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:54:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:54:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:54:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:54:57,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:54:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:57,947 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:54:57,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:54:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:54:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:54:57,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:57,948 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 12:54:57,948 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:57,949 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 12:54:57,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:57,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:57,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:58,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:58,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:58,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:58,077 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:54:58,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:58,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:58,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:54:58,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:54:58,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:54:58,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:58,141 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-04 12:54:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:58,183 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:54:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:54:58,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-04 12:54:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:58,184 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:54:58,184 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:54:58,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 12:54:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:54:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:54:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:54:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:54:58,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:54:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:58,189 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:54:58,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:54:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:54:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:54:58,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:58,190 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 12:54:58,190 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:58,190 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 12:54:58,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:58,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:58,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:58,710 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:58,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:58,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:58,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:58,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:54:58,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:54:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:54:58,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:58,815 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-04 12:54:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:58,852 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:54:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:54:58,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-04 12:54:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:58,853 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:54:58,853 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:54:58,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 8 [2018-10-04 12:54:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:54:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:54:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:54:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:54:58,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:54:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:58,857 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:54:58,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:54:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:54:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:54:58,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:58,858 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 12:54:58,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:58,859 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:58,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 12:54:58,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:58,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:58,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:59,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:59,011 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:59,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:59,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:59,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:59,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:59,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:59,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:54:59,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:54:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:54:59,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:59,131 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-04 12:54:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:59,180 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:54:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:54:59,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-04 12:54:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:59,181 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:54:59,181 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:54:59,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:54:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:54:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:54:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:54:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:54:59,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:54:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:59,185 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:54:59,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:54:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:54:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:54:59,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:59,185 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 12:54:59,186 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:59,186 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 12:54:59,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:59,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:59,379 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:59,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:59,411 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:54:59,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:59,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:59,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:59,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:54:59,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:54:59,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:54:59,479 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:59,479 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-04 12:54:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:59,506 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:54:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:54:59,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 12:54:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:59,507 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:54:59,507 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:54:59,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 12:54:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:54:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:54:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:54:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:54:59,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 12:54:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:59,511 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:54:59,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:54:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:54:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:54:59,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:59,512 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 12:54:59,512 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:59,512 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 12:54:59,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:59,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:59,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:59,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:59,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:59,727 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:59,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:59,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:54:59,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:54:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:54:59,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:59,835 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-04 12:54:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:59,881 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:54:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:54:59,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 12:54:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:59,883 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:54:59,883 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:54:59,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 12:54:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:54:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:54:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:54:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 12:54:59,887 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 12:54:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:59,887 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 12:54:59,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:54:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 12:54:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:54:59,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:59,888 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 12:54:59,888 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:59,889 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 12:54:59,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:00,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:00,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:00,183 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:55:00,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:00,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:00,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:00,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:55:00,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:55:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:55:00,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:00,249 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-04 12:55:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:00,279 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 12:55:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:55:00,280 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:55:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:00,281 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:55:00,281 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:55:00,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-04 12:55:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:55:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:55:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:55:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:55:00,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 12:55:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:00,286 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:55:00,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:55:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:55:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:55:00,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:00,286 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 12:55:00,287 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:00,287 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 12:55:00,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:00,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:00,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:00,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:00,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:00,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:00,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:00,467 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:55:00,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:00,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:00,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:00,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:55:00,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:55:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:55:00,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:00,552 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-04 12:55:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:00,580 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:55:00,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:55:00,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 12:55:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:00,582 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:55:00,582 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:55:00,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 12:55:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:55:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 12:55:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:55:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 12:55:00,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 12:55:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:00,589 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 12:55:00,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:55:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 12:55:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:55:00,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:00,590 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 12:55:00,591 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:00,591 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 12:55:00,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:00,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:00,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:00,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:00,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:00,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:00,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:55:00,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:55:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:55:00,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:00,856 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-04 12:55:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:00,887 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 12:55:00,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:55:00,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 12:55:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:00,889 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:55:00,889 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:55:00,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 12:55:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:55:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:55:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:55:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:55:00,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 12:55:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:00,894 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:55:00,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:55:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:55:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:55:00,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:00,895 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 12:55:00,895 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:00,895 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 12:55:00,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:00,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:00,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:00,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:01,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:01,112 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:01,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:01,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:01,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:01,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:01,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:55:01,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:55:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:55:01,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:01,327 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-04 12:55:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:01,510 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:55:01,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:55:01,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:55:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:01,511 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:55:01,511 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:55:01,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 15 [2018-10-04 12:55:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:55:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 12:55:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:55:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 12:55:01,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 12:55:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:01,516 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 12:55:01,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:55:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 12:55:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:55:01,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:01,517 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 12:55:01,517 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:01,517 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 12:55:01,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:01,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:01,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:01,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:01,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:01,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:01,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:01,846 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:55:01,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:01,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:55:01,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:55:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:55:01,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:01,980 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-04 12:55:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:02,022 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 12:55:02,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:55:02,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-04 12:55:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:02,023 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:55:02,023 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:55:02,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 12:55:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:55:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:55:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:55:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:55:02,027 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 12:55:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:02,028 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:55:02,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:55:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:55:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:55:02,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:02,029 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 12:55:02,029 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:02,029 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 12:55:02,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:02,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:02,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:02,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:02,347 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:02,391 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:02,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:02,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:02,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:55:02,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:55:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:55:02,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:02,706 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-04 12:55:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:02,752 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:55:02,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:55:02,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-04 12:55:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:02,753 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:55:02,753 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:55:02,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 17 [2018-10-04 12:55:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:55:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:55:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:55:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 12:55:02,756 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 12:55:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:02,757 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 12:55:02,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:55:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 12:55:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:55:02,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:02,758 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 12:55:02,758 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:02,758 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:02,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 12:55:02,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:02,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:02,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:02,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:03,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:03,049 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:03,057 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:03,103 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 12:55:03,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:03,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:03,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 12:55:03,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:55:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:55:03,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:03,282 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-04 12:55:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:03,382 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 12:55:03,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:55:03,382 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-04 12:55:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:03,383 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:55:03,383 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:55:03,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 12:55:03,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:55:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:55:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:55:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:55:03,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 12:55:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:03,387 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:55:03,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:55:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:55:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:55:03,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:03,388 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 12:55:03,388 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:03,388 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 12:55:03,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:03,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:03,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:03,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:03,678 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:03,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:03,680 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:03,690 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:03,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 12:55:03,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:03,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:03,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:03,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:55:03,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:55:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:55:03,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:03,967 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-04 12:55:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:04,137 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:55:04,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:55:04,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-04 12:55:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:04,138 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:55:04,138 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:55:04,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 6 [2018-10-04 12:55:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:55:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:55:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:55:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 12:55:04,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 12:55:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:04,143 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 12:55:04,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:55:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 12:55:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:55:04,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:04,144 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 12:55:04,144 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:04,144 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 12:55:04,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:04,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:04,362 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:04,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:04,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:04,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:04,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:04,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:04,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:55:04,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:55:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:55:04,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:04,502 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-04 12:55:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:04,538 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 12:55:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:55:04,539 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-04 12:55:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:04,540 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:55:04,540 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:55:04,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:55:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:55:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:55:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:55:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:55:04,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 12:55:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:04,545 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:55:04,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:55:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:55:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:55:04,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:04,546 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 12:55:04,547 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:04,547 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 12:55:04,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:04,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:04,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:04,849 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:04,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:04,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:04,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:04,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:04,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:04,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:05,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 12:55:05,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:55:05,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:55:05,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:05,157 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-04 12:55:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:05,192 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:55:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:55:05,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-04 12:55:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:05,193 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:55:05,193 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:55:05,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 8 [2018-10-04 12:55:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:55:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:55:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:55:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 12:55:05,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 12:55:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:05,198 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 12:55:05,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:55:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 12:55:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:55:05,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:05,199 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 12:55:05,199 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:05,199 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 12:55:05,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:05,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:05,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:05,837 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:05,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:05,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:05,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:05,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 12:55:05,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:05,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:06,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:06,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:55:06,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:55:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:55:06,014 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:06,014 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-04 12:55:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:06,049 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 12:55:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:55:06,052 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-04 12:55:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:06,053 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:55:06,053 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:55:06,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 9 [2018-10-04 12:55:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:55:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:55:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:55:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:55:06,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 12:55:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:06,057 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:55:06,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:55:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:55:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:55:06,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:06,058 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 12:55:06,058 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:06,058 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 12:55:06,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:06,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:06,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:06,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:06,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:06,314 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:06,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:06,424 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:06,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:06,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:06,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:55:06,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:55:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:55:06,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:06,506 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-04 12:55:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:06,605 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:55:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:55:06,605 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-04 12:55:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:06,606 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:55:06,606 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:55:06,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 10 [2018-10-04 12:55:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:55:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:55:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:55:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 12:55:06,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 12:55:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:06,610 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 12:55:06,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:55:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 12:55:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:55:06,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:06,611 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 12:55:06,611 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:06,611 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 12:55:06,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:06,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:06,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:06,922 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:06,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:06,994 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:07,002 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:07,026 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 12:55:07,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:07,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:07,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:07,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 12:55:07,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:55:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:55:07,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:07,181 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-04 12:55:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:07,224 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 12:55:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:55:07,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-04 12:55:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:07,225 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:55:07,225 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:55:07,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 11 [2018-10-04 12:55:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:55:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:55:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:55:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:55:07,230 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 12:55:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:07,230 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:55:07,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:55:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:55:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:55:07,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:07,231 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 12:55:07,231 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:07,232 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 12:55:07,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:07,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:07,462 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:07,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:07,520 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:07,529 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:07,556 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:55:07,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:07,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:07,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:07,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:55:07,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:55:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:55:07,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:07,792 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-04 12:55:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:08,042 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 12:55:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:55:08,042 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-04 12:55:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:08,043 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:55:08,043 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:55:08,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 12 [2018-10-04 12:55:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:55:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 12:55:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:55:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 12:55:08,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 12:55:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:08,051 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 12:55:08,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:55:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 12:55:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 12:55:08,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:08,052 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 12:55:08,052 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:08,054 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 12:55:08,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:08,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:08,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:08,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:08,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:08,289 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:08,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:08,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:08,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:08,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:08,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 12:55:08,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:55:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:55:08,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:08,529 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-04 12:55:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:08,604 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 12:55:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:55:08,604 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-04 12:55:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:08,605 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:55:08,605 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:55:08,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 12:55:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:55:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:55:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:55:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:55:08,610 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 12:55:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:08,610 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:55:08,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:55:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:55:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:55:08,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:08,611 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 12:55:08,611 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:08,611 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 12:55:08,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:08,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:08,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:08,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:08,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:09,012 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:09,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:09,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:09,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:09,225 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:09,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:09,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:09,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:09,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 12:55:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:55:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:55:09,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:09,344 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-04 12:55:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:09,408 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:55:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:55:09,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-04 12:55:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:09,409 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:55:09,409 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:55:09,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 14 [2018-10-04 12:55:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:55:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:55:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:55:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 12:55:09,413 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 12:55:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:09,413 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 12:55:09,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:55:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 12:55:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:55:09,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:09,414 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 12:55:09,415 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:09,415 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 12:55:09,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:09,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:09,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:10,171 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:10,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:10,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:10,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:10,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 12:55:10,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:10,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:10,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:10,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:55:10,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:55:10,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:55:10,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:10,535 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-04 12:55:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:10,647 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 12:55:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:55:10,648 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-04 12:55:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:10,648 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:55:10,648 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:55:10,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 15 [2018-10-04 12:55:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:55:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:55:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:55:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:55:10,652 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 12:55:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:10,653 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:55:10,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:55:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:55:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:55:10,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:10,653 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 12:55:10,654 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:10,654 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 12:55:10,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:10,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:10,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:10,866 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:11,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:11,077 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:11,105 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:11,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:11,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:11,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:55:11,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:55:11,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:55:11,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:11,220 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-04 12:55:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:11,274 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 12:55:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:55:11,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-04 12:55:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:11,275 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:55:11,275 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:55:11,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 16 [2018-10-04 12:55:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:55:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 12:55:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:55:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 12:55:11,280 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 12:55:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:11,280 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 12:55:11,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:55:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 12:55:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:55:11,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:11,281 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 12:55:11,281 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:11,281 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:11,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 12:55:11,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:11,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:11,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:11,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:11,600 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:11,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:11,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:11,732 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:11,759 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 12:55:11,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:11,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:11,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 12:55:11,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:55:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:55:11,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:11,845 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-04 12:55:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:11,884 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 12:55:11,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:55:11,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-04 12:55:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:11,885 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:55:11,885 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:55:11,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 17 [2018-10-04 12:55:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:55:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:55:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:55:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:55:11,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 12:55:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:11,890 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:55:11,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:55:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:55:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:55:11,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:11,890 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 12:55:11,891 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:11,891 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 12:55:11,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:11,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:11,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:12,992 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:13,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:13,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:13,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:13,350 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 12:55:13,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:13,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:13,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:13,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 12:55:13,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:55:13,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:55:13,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:13,440 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-04 12:55:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:13,502 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:55:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:55:13,502 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-04 12:55:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:13,503 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:55:13,503 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:55:13,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 18 [2018-10-04 12:55:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:55:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 12:55:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:55:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 12:55:13,507 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 12:55:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:13,507 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 12:55:13,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:55:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 12:55:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:55:13,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:13,508 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 12:55:13,508 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:13,508 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 12:55:13,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:13,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:13,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:13,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:13,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:13,968 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:14,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:14,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:14,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:14,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:14,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:14,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 12:55:14,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:55:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:55:14,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:14,689 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-04 12:55:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:14,754 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 12:55:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:55:14,754 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-04 12:55:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:14,755 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:55:14,755 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:55:14,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 19 [2018-10-04 12:55:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:55:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:55:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:55:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 12:55:14,760 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 12:55:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:14,760 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 12:55:14,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:55:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 12:55:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:55:14,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:14,761 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 12:55:14,761 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:14,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:14,761 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 12:55:14,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:14,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:14,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:14,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:14,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:15,051 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:15,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:15,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:15,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:15,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:15,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:15,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 12:55:15,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:55:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:55:15,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:15,343 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-04 12:55:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:15,383 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 12:55:15,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:55:15,384 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-04 12:55:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:15,384 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:55:15,385 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:55:15,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 20 [2018-10-04 12:55:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:55:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 12:55:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 12:55:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 12:55:15,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 12:55:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:15,388 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 12:55:15,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:55:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 12:55:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:55:15,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:15,389 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 12:55:15,389 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:15,390 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 12:55:15,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:15,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:15,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:15,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:15,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:15,637 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:15,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:15,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:15,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:16,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 12:55:16,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:16,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:16,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:16,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 12:55:16,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:55:16,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:55:16,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:16,137 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-04 12:55:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:16,192 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 12:55:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:55:16,192 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-04 12:55:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:16,193 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:55:16,193 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:55:16,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 21 [2018-10-04 12:55:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:55:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:55:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:55:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:55:16,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 12:55:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:16,196 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:55:16,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:55:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:55:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:55:16,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:16,197 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 12:55:16,197 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:16,197 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 12:55:16,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:16,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:16,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:16,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:16,423 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:16,832 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:16,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:16,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:16,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:16,866 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:16,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:16,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:17,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:17,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 12:55:17,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:55:17,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:55:17,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:17,017 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-04 12:55:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:17,076 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:55:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:55:17,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-04 12:55:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:17,077 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:55:17,077 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:55:17,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 7 [2018-10-04 12:55:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:55:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 12:55:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:55:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 12:55:17,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 12:55:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:17,081 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 12:55:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:55:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 12:55:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:55:17,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:17,082 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 12:55:17,082 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:17,082 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 12:55:17,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:17,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:17,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:17,326 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:17,753 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:17,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:17,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:17,894 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 12:55:17,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:17,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:18,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:18,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 12:55:18,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:55:18,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:55:18,038 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:18,038 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-04 12:55:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:18,149 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 12:55:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:55:18,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-04 12:55:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:18,150 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:55:18,150 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:55:18,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 8 [2018-10-04 12:55:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:55:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 12:55:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:55:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 12:55:18,153 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 12:55:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:18,153 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 12:55:18,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:55:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 12:55:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:55:18,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:18,154 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 12:55:18,154 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:18,155 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 12:55:18,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:18,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:18,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:18,331 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:18,643 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:18,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:18,911 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:55:18,911 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:18,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:19,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:19,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 12:55:19,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:55:19,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:55:19,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:19,483 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-04 12:55:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:19,538 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 12:55:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:55:19,539 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-04 12:55:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:19,539 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:55:19,540 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 12:55:19,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.5s impTime 9 [2018-10-04 12:55:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 12:55:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 12:55:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:55:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 12:55:19,543 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 12:55:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:19,543 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 12:55:19,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:55:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 12:55:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:55:19,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:19,544 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 12:55:19,544 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:19,544 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 12:55:19,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:19,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:19,742 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:19,973 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:20,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:20,039 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:20,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:20,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:20,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 12:55:20,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:55:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:55:20,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:20,190 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-04 12:55:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:20,284 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 12:55:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:55:20,284 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-04 12:55:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:20,285 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:55:20,285 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:55:20,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 10 [2018-10-04 12:55:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:55:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:55:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:55:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:55:20,289 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 12:55:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:20,289 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:55:20,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:55:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:55:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:55:20,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:20,290 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 12:55:20,290 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:20,290 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 12:55:20,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:20,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:20,511 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:20,855 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:20,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:20,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:21,018 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:21,018 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:21,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:21,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:21,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 12:55:21,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:55:21,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:55:21,110 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:21,110 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-04 12:55:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:21,169 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 12:55:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:55:21,170 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-04 12:55:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:21,170 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:55:21,170 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:55:21,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 11 [2018-10-04 12:55:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:55:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 12:55:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:55:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 12:55:21,173 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 12:55:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:21,174 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 12:55:21,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:55:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 12:55:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:55:21,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:21,175 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 12:55:21,175 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:21,175 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:21,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 12:55:21,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:21,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:21,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:21,433 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:21,858 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:22,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:22,033 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:22,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:22,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 12:55:22,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:22,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:22,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:22,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 12:55:22,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:55:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:55:22,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:22,195 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-04 12:55:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:22,260 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 12:55:22,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:55:22,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-04 12:55:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:22,261 INFO L225 Difference]: With dead ends: 44 [2018-10-04 12:55:22,261 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:55:22,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 12 [2018-10-04 12:55:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:55:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 12:55:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:55:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 12:55:22,265 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 12:55:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:22,265 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 12:55:22,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:55:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 12:55:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:55:22,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:22,266 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 12:55:22,266 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:22,266 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 12:55:22,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:22,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:22,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:22,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:22,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:22,657 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:23,632 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:23,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:23,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:23,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:23,719 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:23,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:23,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:23,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:23,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 12:55:23,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:55:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:55:23,833 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:23,833 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-04 12:55:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:23,948 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 12:55:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:55:23,948 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-04 12:55:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:23,949 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:55:23,949 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:55:23,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.1s impTime 13 [2018-10-04 12:55:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:55:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:55:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:55:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 12:55:23,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 12:55:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:23,952 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 12:55:23,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:55:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 12:55:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:55:23,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:23,953 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 12:55:23,953 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:23,953 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 12:55:23,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:23,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:24,478 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:24,901 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:25,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:25,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:25,189 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 12:55:25,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:25,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:25,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:25,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 12:55:25,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:55:25,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:55:25,302 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:25,302 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-04 12:55:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:25,605 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 12:55:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:55:25,606 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-04 12:55:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:25,606 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:55:25,606 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:55:25,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 14 [2018-10-04 12:55:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:55:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 12:55:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:55:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 12:55:25,609 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 12:55:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:25,609 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 12:55:25,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:55:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 12:55:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:55:25,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:25,610 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 12:55:25,611 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:25,611 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:25,611 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 12:55:25,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:25,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:25,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:25,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:25,870 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:26,139 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:26,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:26,354 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:26,393 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 12:55:26,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:26,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:26,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:26,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 12:55:26,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:55:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:55:26,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:26,509 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-04 12:55:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:26,575 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 12:55:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:55:26,576 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-04 12:55:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:26,576 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:55:26,576 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 12:55:26,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 15 [2018-10-04 12:55:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 12:55:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 12:55:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 12:55:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 12:55:26,580 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 12:55:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:26,580 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 12:55:26,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:55:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 12:55:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:55:26,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:26,580 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 12:55:26,581 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:26,581 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 12:55:26,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:26,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:26,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:26,922 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:27,431 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:27,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:27,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:27,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:27,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:27,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:27,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 12:55:27,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:55:27,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:55:27,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:27,880 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-04 12:55:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:27,942 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 12:55:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:55:27,942 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-04 12:55:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:27,943 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:55:27,943 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:55:27,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.5s impTime 16 [2018-10-04 12:55:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:55:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 12:55:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:55:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 12:55:27,946 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-04 12:55:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:27,946 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 12:55:27,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:55:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 12:55:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:55:27,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:27,947 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-04 12:55:27,947 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:27,947 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-04 12:55:27,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:27,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:28,458 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:28,627 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:28,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:28,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:28,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:28,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:28,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:28,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:28,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 12:55:28,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:55:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:55:28,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:28,977 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-04 12:55:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:29,043 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 12:55:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:55:29,043 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-04 12:55:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:29,044 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:55:29,044 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:55:29,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 17 [2018-10-04 12:55:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:55:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 12:55:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 12:55:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 12:55:29,047 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-04 12:55:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:29,047 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 12:55:29,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:55:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 12:55:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 12:55:29,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:29,048 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-04 12:55:29,048 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:29,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-04 12:55:29,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:29,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:29,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:29,262 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:29,937 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:30,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:30,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:30,325 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 12:55:30,325 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:30,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:30,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:30,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 12:55:30,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:55:30,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:55:30,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:30,454 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-04 12:55:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:30,919 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 12:55:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:55:30,919 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-04 12:55:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:30,920 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:55:30,920 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:55:30,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 1.0s impTime 18 [2018-10-04 12:55:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:55:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 12:55:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:55:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 12:55:30,924 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-04 12:55:30,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:30,924 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 12:55:30,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:55:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 12:55:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:55:30,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:30,925 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-04 12:55:30,925 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:30,925 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-04 12:55:30,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:30,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:30,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:31,146 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:31,513 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:31,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:31,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:31,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:31,996 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:31,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:31,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 12:55:32,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:55:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:55:32,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:32,132 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-04 12:55:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:32,210 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 12:55:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:55:32,210 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-04 12:55:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:32,211 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:55:32,211 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:55:32,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 19 [2018-10-04 12:55:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:55:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 12:55:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 12:55:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 12:55:32,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-04 12:55:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:32,214 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 12:55:32,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:55:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 12:55:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:55:32,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:32,215 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-04 12:55:32,215 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:32,215 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-04 12:55:32,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:32,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:32,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:32,596 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:32,792 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:33,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:33,105 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:33,144 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 12:55:33,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:33,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:33,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:33,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 12:55:33,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:55:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:55:33,337 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:33,337 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-04 12:55:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:33,461 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 12:55:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:55:33,462 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-04 12:55:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:33,462 INFO L225 Difference]: With dead ends: 52 [2018-10-04 12:55:33,462 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:55:33,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 20 [2018-10-04 12:55:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:55:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 12:55:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:55:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 12:55:33,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-04 12:55:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:33,464 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 12:55:33,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:55:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 12:55:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 12:55:33,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:33,465 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-04 12:55:33,465 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:33,465 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-04 12:55:33,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:33,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:33,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:33,705 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:34,120 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:34,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:34,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:34,356 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:34,397 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:55:34,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:34,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:34,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:34,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 12:55:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:55:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:55:34,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:34,524 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-04 12:55:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:34,609 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 12:55:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:55:34,609 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-04 12:55:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:34,610 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:55:34,610 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 12:55:34,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 21 [2018-10-04 12:55:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 12:55:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 12:55:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:55:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 12:55:34,613 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-04 12:55:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:34,614 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 12:55:34,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:55:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 12:55:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 12:55:34,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:34,615 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-04 12:55:34,615 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:34,615 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-04 12:55:34,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:34,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:34,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:34,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:34,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:35,760 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:36,122 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:36,727 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:36,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:36,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:36,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:36,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:36,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 12:55:36,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:55:36,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:55:36,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:36,883 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-04 12:55:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:36,966 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 12:55:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:55:36,966 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-04 12:55:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:36,967 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:55:36,967 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:55:36,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.6s impTime 7 [2018-10-04 12:55:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:55:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 12:55:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:55:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 12:55:36,970 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-04 12:55:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:36,970 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 12:55:36,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:55:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 12:55:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:55:36,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:36,970 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-04 12:55:36,971 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:36,971 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-04 12:55:36,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:36,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:36,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:36,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:36,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:37,214 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:37,604 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:38,210 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:38,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:38,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:38,302 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:38,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:38,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:38,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:38,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 12:55:38,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:55:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:55:38,493 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:38,493 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-04 12:55:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:38,590 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 12:55:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:55:38,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-04 12:55:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:38,592 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:55:38,592 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:55:38,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 8 [2018-10-04 12:55:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:55:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-04 12:55:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 12:55:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 12:55:38,595 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-04 12:55:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:38,595 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 12:55:38,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:55:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 12:55:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 12:55:38,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:38,596 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-04 12:55:38,596 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:38,596 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-04 12:55:38,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:38,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:39,153 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:39,534 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:39,973 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:39,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:39,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:40,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:40,045 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 12:55:40,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:40,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:40,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:40,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 12:55:40,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:55:40,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:55:40,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:40,180 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-04 12:55:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:40,263 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 12:55:40,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:55:40,264 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-04 12:55:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:40,264 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:55:40,265 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:55:40,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 9 [2018-10-04 12:55:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:55:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 12:55:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:55:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 12:55:40,268 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-04 12:55:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:40,268 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 12:55:40,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:55:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 12:55:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:55:40,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:40,269 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-04 12:55:40,269 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:40,269 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-04 12:55:40,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:40,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:40,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:40,532 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:40,773 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:41,051 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:41,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:41,126 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:41,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:41,167 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:41,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:41,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:41,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 12:55:41,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:55:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:55:41,429 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:41,429 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-04 12:55:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:41,566 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 12:55:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:55:41,566 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-04 12:55:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:41,567 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:55:41,568 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 12:55:41,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 10 [2018-10-04 12:55:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 12:55:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 12:55:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 12:55:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 12:55:41,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-04 12:55:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:41,572 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 12:55:41,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:55:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 12:55:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 12:55:41,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:41,572 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-04 12:55:41,573 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:41,573 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-04 12:55:41,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:41,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:41,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:41,857 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:42,276 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:42,877 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:43,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:43,059 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:43,116 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-04 12:55:43,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:43,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:43,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:43,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 12:55:43,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:55:43,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:55:43,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:43,242 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-04 12:55:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:43,331 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 12:55:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:55:43,332 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-04 12:55:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:43,333 INFO L225 Difference]: With dead ends: 58 [2018-10-04 12:55:43,333 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:55:43,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 11 [2018-10-04 12:55:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:55:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:55:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:55:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 12:55:43,336 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-04 12:55:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:43,336 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 12:55:43,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:55:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 12:55:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:55:43,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:43,337 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-04 12:55:43,337 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:43,337 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-04 12:55:43,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:43,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:43,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:43,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:43,823 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:44,035 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:44,390 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:44,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:44,629 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:44,687 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 12:55:44,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:44,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:44,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:44,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 12:55:44,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:55:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:55:44,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:44,850 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-04 12:55:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:44,943 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 12:55:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:55:44,944 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-04 12:55:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:44,945 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:55:44,945 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:55:44,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 12 [2018-10-04 12:55:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:55:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-04 12:55:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 12:55:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 12:55:44,948 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-04 12:55:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:44,948 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 12:55:44,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:55:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 12:55:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:55:44,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:44,948 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-04 12:55:44,948 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:44,949 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-04 12:55:44,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:44,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:44,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:45,286 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:45,678 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:45,972 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:46,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:46,052 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:46,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:46,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:46,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 12:55:46,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:55:46,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:55:46,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:46,217 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-04 12:55:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:46,294 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 12:55:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:55:46,295 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-04 12:55:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:46,295 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:55:46,295 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:55:46,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 13 [2018-10-04 12:55:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:55:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 12:55:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:55:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 12:55:46,298 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-04 12:55:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:46,299 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 12:55:46,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:55:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 12:55:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:55:46,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:46,299 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-04 12:55:46,299 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:46,300 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-04 12:55:46,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:46,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:55:46,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:46,527 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:46,899 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:47,493 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:47,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:47,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:55:47,909 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:55:47,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:47,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:48,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 12:55:48,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:55:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:55:48,043 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:48,043 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-04 12:55:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:48,139 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 12:55:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:55:48,139 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-04 12:55:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:48,140 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:55:48,140 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 12:55:48,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 14 [2018-10-04 12:55:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 12:55:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-04 12:55:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 12:55:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 12:55:48,143 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-04 12:55:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:48,143 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 12:55:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:55:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 12:55:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 12:55:48,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:48,144 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-04 12:55:48,144 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:48,144 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-04 12:55:48,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:48,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:48,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:48,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:48,474 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:49,090 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:49,440 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:49,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:49,540 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:49,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:55:49,594 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 12:55:49,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:49,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:49,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:49,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 12:55:49,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:55:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:55:49,748 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:49,748 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-04 12:55:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:49,824 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 12:55:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:55:49,824 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-04 12:55:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:49,825 INFO L225 Difference]: With dead ends: 62 [2018-10-04 12:55:49,825 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:55:49,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 15 [2018-10-04 12:55:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:55:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 12:55:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:55:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 12:55:49,829 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-04 12:55:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:49,829 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 12:55:49,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:55:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 12:55:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:55:49,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:49,830 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-04 12:55:49,830 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:49,830 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-04 12:55:49,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:49,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:49,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:50,282 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:50,557 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:50,872 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:51,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:51,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:51,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:55:51,352 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:55:51,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:51,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:51,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:51,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 12:55:51,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:55:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:55:51,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:51,470 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-04 12:55:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:51,579 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 12:55:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:55:51,579 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-04 12:55:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:51,580 INFO L225 Difference]: With dead ends: 63 [2018-10-04 12:55:51,580 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:55:51,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 16 [2018-10-04 12:55:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:55:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 12:55:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:55:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 12:55:51,584 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-04 12:55:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:51,584 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 12:55:51,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:55:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 12:55:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 12:55:51,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:51,585 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-04 12:55:51,585 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:51,585 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-04 12:55:51,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:51,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:51,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:51,803 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:52,171 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:52,714 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:53,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:53,170 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:55:53,223 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 12:55:53,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:53,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:53,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:53,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 12:55:53,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:55:53,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:55:53,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:53,364 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-04 12:55:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:53,481 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 12:55:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:55:53,482 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-04 12:55:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:53,483 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:55:53,483 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:55:53,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 17 [2018-10-04 12:55:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:55:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:55:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:55:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 12:55:53,486 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-04 12:55:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:53,486 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 12:55:53,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:55:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 12:55:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 12:55:53,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:53,487 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-04 12:55:53,487 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:53,487 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-04 12:55:53,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:53,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:55:56,839 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:55:57,279 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:57,441 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:55:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:57,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:55:57,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:55:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:55:57,722 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:55:57,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:55:57,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:55:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:55:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:55:58,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 12:55:58,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 12:55:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 12:55:58,013 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:55:58,013 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-04 12:55:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:55:58,098 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 12:55:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:55:58,098 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-04 12:55:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:55:58,099 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:55:58,099 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 12:55:58,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s Time 3.4s impTime 18 [2018-10-04 12:55:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 12:55:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-04 12:55:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:55:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 12:55:58,102 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-04 12:55:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:55:58,102 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 12:55:58,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 12:55:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 12:55:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 12:55:58,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:55:58,103 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-04 12:55:58,103 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:55:58,103 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:55:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-04 12:55:58,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:55:58,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:55:58,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:58,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:55:58,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:55:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:00,304 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:00,719 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:01,326 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:01,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:01,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:01,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:01,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:01,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 12:56:01,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:56:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:56:01,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:01,797 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-04 12:56:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:01,878 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 12:56:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:56:01,879 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-04 12:56:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:01,879 INFO L225 Difference]: With dead ends: 66 [2018-10-04 12:56:01,880 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:56:01,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 2.8s impTime 19 [2018-10-04 12:56:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:56:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 12:56:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:56:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 12:56:01,883 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-04 12:56:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:01,883 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 12:56:01,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:56:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 12:56:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 12:56:01,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:01,884 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-04 12:56:01,885 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:01,885 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-04 12:56:01,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:01,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:02,128 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:02,538 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:03,135 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:03,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:03,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:03,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:03,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:03,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:03,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:04,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:04,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 12:56:04,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:56:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:56:04,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:04,048 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-04 12:56:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:04,291 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 12:56:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:56:04,291 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-04 12:56:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:04,292 INFO L225 Difference]: With dead ends: 67 [2018-10-04 12:56:04,292 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 12:56:04,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.6s impTime 20 [2018-10-04 12:56:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 12:56:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 12:56:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 12:56:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 12:56:04,294 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-04 12:56:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 12:56:04,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:56:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 12:56:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:56:04,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:04,295 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-04 12:56:04,296 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:04,296 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-04 12:56:04,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:04,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:05,429 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:05,839 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:06,453 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:07,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:07,182 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:07,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:07,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 12:56:07,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:07,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:07,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:07,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 12:56:07,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:56:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:56:07,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:07,673 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-04 12:56:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:07,785 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 12:56:07,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 12:56:07,786 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-04 12:56:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:07,786 INFO L225 Difference]: With dead ends: 68 [2018-10-04 12:56:07,787 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 12:56:07,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.4s impTime 21 [2018-10-04 12:56:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 12:56:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 12:56:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:56:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 12:56:07,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-04 12:56:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:07,791 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 12:56:07,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:56:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 12:56:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:56:07,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:07,792 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-04 12:56:07,792 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:07,792 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-04 12:56:07,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:07,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:07,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:08,029 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:08,442 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:09,148 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:09,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:09,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:09,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:09,651 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:09,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:09,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:09,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:09,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 12:56:09,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 12:56:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 12:56:09,846 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:09,846 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-04 12:56:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:09,929 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 12:56:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 12:56:09,929 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-04 12:56:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:09,930 INFO L225 Difference]: With dead ends: 69 [2018-10-04 12:56:09,930 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:56:09,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 22 [2018-10-04 12:56:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:56:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 12:56:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:56:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 12:56:09,934 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-04 12:56:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:09,934 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 12:56:09,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 12:56:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 12:56:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:56:09,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:09,934 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-04 12:56:09,935 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:09,935 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-04 12:56:09,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:09,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:10,129 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:10,574 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:10,755 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:11,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:11,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:11,121 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:11,177 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 12:56:11,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:11,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:11,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:11,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 12:56:11,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:56:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:56:11,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:11,434 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-04 12:56:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:11,534 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 12:56:11,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 12:56:11,535 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-04 12:56:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:11,535 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:56:11,536 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:56:11,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 23 [2018-10-04 12:56:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:56:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 12:56:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:56:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 12:56:11,539 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-04 12:56:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:11,539 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 12:56:11,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:56:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 12:56:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:56:11,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:11,539 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-04 12:56:11,540 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:11,540 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-04 12:56:11,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:11,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:11,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:11,713 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:12,088 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:12,632 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:13,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:13,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:13,474 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:13,528 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 12:56:13,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:13,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:13,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:13,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 12:56:13,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:56:13,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:56:13,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:13,689 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-04 12:56:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:13,812 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 12:56:13,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:56:13,812 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-04 12:56:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:13,813 INFO L225 Difference]: With dead ends: 71 [2018-10-04 12:56:13,813 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:56:13,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.7s impTime 24 [2018-10-04 12:56:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:56:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 12:56:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 12:56:13,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 12:56:13,817 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-04 12:56:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:13,817 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 12:56:13,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:56:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 12:56:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 12:56:13,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:13,818 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-04 12:56:13,818 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:13,818 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:13,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-04 12:56:13,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:13,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:13,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:14,162 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:14,628 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:14,944 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:15,939 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:15,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:15,946 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:15,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:16,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:16,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 12:56:16,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:56:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:56:16,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:16,220 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-04 12:56:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:16,352 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 12:56:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 12:56:16,353 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-04 12:56:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:16,354 INFO L225 Difference]: With dead ends: 72 [2018-10-04 12:56:16,354 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 12:56:16,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.7s impTime 8 [2018-10-04 12:56:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 12:56:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 12:56:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 12:56:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 12:56:16,357 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-04 12:56:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:16,357 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 12:56:16,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:56:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 12:56:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 12:56:16,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:16,358 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-04 12:56:16,358 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:16,358 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-04 12:56:16,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:16,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:16,515 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:16,904 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:17,255 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:17,612 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:17,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:17,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:17,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:17,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:17,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:17,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:17,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:17,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 12:56:17,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 12:56:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 12:56:17,838 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:17,838 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-04 12:56:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:17,937 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 12:56:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 12:56:17,937 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-04 12:56:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:17,938 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:56:17,938 INFO L226 Difference]: Without dead ends: 72 [2018-10-04 12:56:17,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 9 [2018-10-04 12:56:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-04 12:56:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-04 12:56:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 12:56:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 12:56:17,941 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-04 12:56:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:17,941 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 12:56:17,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 12:56:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 12:56:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:56:17,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:17,942 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-04 12:56:17,942 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:17,942 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-04 12:56:17,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:17,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:18,152 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:18,525 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:19,113 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:20,375 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:20,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:20,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:20,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 12:56:20,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:20,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:20,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:20,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 12:56:20,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:56:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:56:20,716 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:20,716 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-04 12:56:20,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:20,892 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 12:56:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:56:20,892 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-04 12:56:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:20,893 INFO L225 Difference]: With dead ends: 74 [2018-10-04 12:56:20,893 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:56:20,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.2s impTime 10 [2018-10-04 12:56:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:56:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-04 12:56:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:56:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 12:56:20,897 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-04 12:56:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:20,897 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 12:56:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:56:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 12:56:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 12:56:20,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:20,898 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-04 12:56:20,898 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:20,898 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-04 12:56:20,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:20,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:20,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:20,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:21,069 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:21,462 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:21,756 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:22,121 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:22,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:22,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:22,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:22,264 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:22,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:22,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:23,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:23,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 12:56:23,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 12:56:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 12:56:23,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:23,849 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-04 12:56:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:24,684 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 12:56:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 12:56:24,684 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-04 12:56:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:24,685 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:56:24,685 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:56:24,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 1.0s impTime 11 [2018-10-04 12:56:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:56:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 12:56:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:56:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 12:56:24,688 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-04 12:56:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:24,689 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 12:56:24,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 12:56:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 12:56:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:56:24,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:24,690 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-04 12:56:24,690 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:24,690 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-04 12:56:24,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:24,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:24,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:24,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:25,149 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:25,363 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:25,724 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:26,711 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:26,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:27,101 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 12:56:27,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:27,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:27,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:27,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 12:56:27,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:56:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:56:27,258 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:27,258 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-04 12:56:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:27,519 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 12:56:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:56:27,520 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-04 12:56:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:27,521 INFO L225 Difference]: With dead ends: 76 [2018-10-04 12:56:27,521 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:56:27,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.9s impTime 12 [2018-10-04 12:56:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:56:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 12:56:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:56:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 12:56:27,525 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-04 12:56:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:27,526 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 12:56:27,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:56:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 12:56:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 12:56:27,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:27,526 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-04 12:56:27,527 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:27,527 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-04 12:56:27,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:27,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:27,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:27,898 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:28,321 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:28,904 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:30,151 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:30,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:30,473 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:30,480 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:30,579 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:56:30,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:30,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:30,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:30,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 12:56:30,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 12:56:30,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 12:56:30,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:30,965 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-04 12:56:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:31,123 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 12:56:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 12:56:31,123 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-04 12:56:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:31,125 INFO L225 Difference]: With dead ends: 77 [2018-10-04 12:56:31,125 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 12:56:31,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.6s impTime 13 [2018-10-04 12:56:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 12:56:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 12:56:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 12:56:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 12:56:31,128 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-04 12:56:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:31,128 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 12:56:31,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 12:56:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 12:56:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 12:56:31,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:31,129 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-04 12:56:31,129 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:31,130 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-04 12:56:31,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:31,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:31,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:31,371 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:31,682 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:31,949 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:32,511 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:32,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:32,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:32,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:32,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:33,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:33,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 12:56:33,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:56:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:56:33,005 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:33,005 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-04 12:56:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:33,124 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 12:56:33,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 12:56:33,125 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-04 12:56:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:33,126 INFO L225 Difference]: With dead ends: 78 [2018-10-04 12:56:33,126 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 12:56:33,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 14 [2018-10-04 12:56:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 12:56:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 12:56:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:56:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 12:56:33,130 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-04 12:56:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:33,130 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 12:56:33,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:56:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 12:56:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:56:33,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:33,131 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-04 12:56:33,131 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:33,132 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-04 12:56:33,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:33,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:33,710 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:34,099 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:34,520 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:35,109 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:35,309 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:35,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:35,361 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:35,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:35,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 12:56:35,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 12:56:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 12:56:35,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:35,524 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-04 12:56:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:35,639 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 12:56:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:56:35,640 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-04 12:56:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:35,641 INFO L225 Difference]: With dead ends: 79 [2018-10-04 12:56:35,641 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:56:35,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.7s impTime 15 [2018-10-04 12:56:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:56:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 12:56:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 12:56:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 12:56:35,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-04 12:56:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:35,645 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 12:56:35,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 12:56:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 12:56:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 12:56:35,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:35,645 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-04 12:56:35,645 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:35,645 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-04 12:56:35,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:35,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:35,866 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:36,258 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:36,869 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:37,244 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:37,404 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:37,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:37,484 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 12:56:37,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:37,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:37,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:37,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 12:56:37,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:56:37,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:56:37,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:37,648 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-04 12:56:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:37,798 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 12:56:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 12:56:37,799 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-04 12:56:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:37,800 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:56:37,800 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 12:56:37,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.4s impTime 16 [2018-10-04 12:56:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 12:56:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 12:56:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:56:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 12:56:37,802 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-04 12:56:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:37,803 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 12:56:37,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:56:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 12:56:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 12:56:37,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:37,803 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-04 12:56:37,804 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:37,804 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-04 12:56:37,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:37,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:38,032 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:38,394 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:39,004 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:39,257 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:39,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:39,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:39,511 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:39,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:39,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:39,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:39,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 12:56:39,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 12:56:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 12:56:39,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:39,683 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-04 12:56:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:39,835 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 12:56:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 12:56:39,835 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-04 12:56:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:39,835 INFO L225 Difference]: With dead ends: 81 [2018-10-04 12:56:39,835 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:56:39,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 17 [2018-10-04 12:56:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:56:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 12:56:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:56:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 12:56:39,839 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-04 12:56:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:39,839 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 12:56:39,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 12:56:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 12:56:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 12:56:39,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:39,840 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-04 12:56:39,841 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:39,841 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-04 12:56:39,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:40,135 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:40,539 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:40,801 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:41,197 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:41,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:41,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:41,531 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:56:41,598 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 12:56:41,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:41,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:41,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:41,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 12:56:41,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:56:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:56:41,762 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:41,763 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-04 12:56:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:42,734 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 12:56:42,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 12:56:42,735 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-04 12:56:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:42,735 INFO L225 Difference]: With dead ends: 82 [2018-10-04 12:56:42,735 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 12:56:42,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 18 [2018-10-04 12:56:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 12:56:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 12:56:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 12:56:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 12:56:42,738 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-04 12:56:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:42,738 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 12:56:42,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:56:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 12:56:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 12:56:42,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:42,739 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-04 12:56:42,739 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:42,739 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-04 12:56:42,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:42,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:42,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:43,129 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:43,325 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:43,720 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:44,465 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:45,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:45,322 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:56:45,393 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-04 12:56:45,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:45,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:45,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:45,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 12:56:45,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 12:56:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 12:56:45,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:45,561 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-04 12:56:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:45,768 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 12:56:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 12:56:45,768 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-04 12:56:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:45,769 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:56:45,769 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:56:45,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.2s impTime 19 [2018-10-04 12:56:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:56:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 12:56:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 12:56:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 12:56:45,773 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-04 12:56:45,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:45,773 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 12:56:45,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 12:56:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 12:56:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 12:56:45,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:45,774 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-10-04 12:56:45,775 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:45,775 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-10-04 12:56:45,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:45,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:45,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:45,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:46,156 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:46,586 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:47,191 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:48,194 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:48,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:48,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:49,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 12:56:49,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:56:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:56:49,200 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:49,200 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-10-04 12:56:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:49,374 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-04 12:56:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 12:56:49,375 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-10-04 12:56:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:49,376 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:56:49,376 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:56:49,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.7s impTime 20 [2018-10-04 12:56:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:56:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 12:56:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 12:56:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-04 12:56:49,379 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-04 12:56:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:49,379 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-04 12:56:49,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:56:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-04 12:56:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 12:56:49,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:49,379 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-10-04 12:56:49,380 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:49,380 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-10-04 12:56:49,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:56:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:49,586 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:49,913 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:50,741 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:51,730 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:51,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:51,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:51,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:51,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:56:52,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:56:52,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:52,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:52,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:52,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 12:56:52,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 12:56:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 12:56:52,200 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:52,200 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-10-04 12:56:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:52,344 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-04 12:56:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-04 12:56:52,344 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-10-04 12:56:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:52,344 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:56:52,345 INFO L226 Difference]: Without dead ends: 84 [2018-10-04 12:56:52,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.2s impTime 21 [2018-10-04 12:56:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-04 12:56:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-04 12:56:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-04 12:56:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-04 12:56:52,348 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-10-04 12:56:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:52,348 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-04 12:56:52,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-04 12:56:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-04 12:56:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 12:56:52,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:52,349 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-10-04 12:56:52,349 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:52,349 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-10-04 12:56:52,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:52,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:52,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:52,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:52,616 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:52,781 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:53,146 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:54,172 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:54,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:54,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:54,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:56:54,964 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-10-04 12:56:54,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:54,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:56,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:56,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-04 12:56:56,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 12:56:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 12:56:56,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:56,092 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-10-04 12:56:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:56,243 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-04 12:56:56,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 12:56:56,243 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-10-04 12:56:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:56,244 INFO L225 Difference]: With dead ends: 86 [2018-10-04 12:56:56,244 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:56:56,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 1.8s impTime 22 [2018-10-04 12:56:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:56:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 12:56:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:56:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-04 12:56:56,247 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-10-04 12:56:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:56,247 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-04 12:56:56,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 12:56:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-04 12:56:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 12:56:56,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:56,248 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-10-04 12:56:56,248 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:56,248 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-10-04 12:56:56,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:56,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:56,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:56,694 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:56:56,868 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:57,261 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:56:58,238 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:56:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:56:59,244 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:56:59,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:56:59,303 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:56:59,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:56:59,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:56:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:56:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:56:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 12:56:59,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-04 12:56:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-04 12:56:59,471 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:56:59,471 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-10-04 12:56:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:56:59,682 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-04 12:56:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 12:56:59,682 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-10-04 12:56:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:56:59,683 INFO L225 Difference]: With dead ends: 87 [2018-10-04 12:56:59,683 INFO L226 Difference]: Without dead ends: 86 [2018-10-04 12:56:59,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.6s impTime 23 [2018-10-04 12:56:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-04 12:56:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-10-04 12:56:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 12:56:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-04 12:56:59,686 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-10-04 12:56:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:56:59,687 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-04 12:56:59,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-04 12:56:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-04 12:56:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:56:59,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:56:59,688 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-10-04 12:56:59,688 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:56:59,688 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:56:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-10-04 12:56:59,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:56:59,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:56:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:56:59,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:56:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:56:59,924 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:00,170 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:00,845 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:01,626 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:02,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:02,534 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:02,541 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:02,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-10-04 12:57:02,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:02,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:02,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-04 12:57:02,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 12:57:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 12:57:02,987 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:02,987 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-10-04 12:57:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:03,174 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-04 12:57:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 12:57:03,175 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-10-04 12:57:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:03,176 INFO L225 Difference]: With dead ends: 88 [2018-10-04 12:57:03,176 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:57:03,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.5s impTime 24 [2018-10-04 12:57:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:57:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 12:57:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 12:57:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-04 12:57:03,179 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-10-04 12:57:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:03,179 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-04 12:57:03,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 12:57:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-04 12:57:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 12:57:03,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:03,180 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-10-04 12:57:03,180 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:03,180 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-10-04 12:57:03,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:03,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:03,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:03,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:03,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:03,429 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:03,853 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:04,463 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:04,997 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:05,389 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:05,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:05,494 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:57:05,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:05,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 12:57:05,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-04 12:57:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-04 12:57:05,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:05,783 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-10-04 12:57:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:06,070 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-04 12:57:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-04 12:57:06,071 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-10-04 12:57:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:06,071 INFO L225 Difference]: With dead ends: 89 [2018-10-04 12:57:06,072 INFO L226 Difference]: Without dead ends: 88 [2018-10-04 12:57:06,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.8s impTime 8 [2018-10-04 12:57:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-04 12:57:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-04 12:57:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 12:57:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-04 12:57:06,075 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-10-04 12:57:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:06,075 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-04 12:57:06,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-04 12:57:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-04 12:57:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:57:06,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:06,076 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-10-04 12:57:06,077 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:06,077 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:06,077 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-10-04 12:57:06,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:06,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:06,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:06,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:06,373 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:06,692 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:06,985 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:07,976 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:09,179 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:09,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:09,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:09,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:09,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:09,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-04 12:57:09,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:57:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:57:09,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:09,554 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-10-04 12:57:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:09,776 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-04 12:57:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 12:57:09,776 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-10-04 12:57:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:09,777 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:57:09,777 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 12:57:09,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.8s impTime 9 [2018-10-04 12:57:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 12:57:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-04 12:57:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:57:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-04 12:57:09,781 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-10-04 12:57:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:09,781 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-04 12:57:09,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:57:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-04 12:57:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 12:57:09,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:09,782 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-10-04 12:57:09,783 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:09,783 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-10-04 12:57:09,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:09,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:09,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:09,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:10,014 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:10,434 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:11,330 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:12,315 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:13,524 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:13,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:13,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:13,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:13,743 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:13,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:13,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:13,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:13,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 12:57:13,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-04 12:57:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-04 12:57:13,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:13,919 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-10-04 12:57:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:14,149 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 12:57:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-04 12:57:14,150 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-10-04 12:57:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:14,151 INFO L225 Difference]: With dead ends: 91 [2018-10-04 12:57:14,151 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 12:57:14,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.5s impTime 10 [2018-10-04 12:57:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 12:57:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-04 12:57:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 12:57:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-04 12:57:14,153 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-10-04 12:57:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:14,153 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-04 12:57:14,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-04 12:57:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-04 12:57:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 12:57:14,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:14,154 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-10-04 12:57:14,154 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:14,154 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-10-04 12:57:14,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:14,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:14,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:14,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:14,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:14,482 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:14,784 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:15,277 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:16,367 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:17,432 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:17,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:17,648 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:17,738 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-10-04 12:57:17,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:17,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-04 12:57:17,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 12:57:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 12:57:17,921 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:17,921 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-10-04 12:57:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:18,143 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-04 12:57:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 12:57:18,143 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-10-04 12:57:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:18,144 INFO L225 Difference]: With dead ends: 92 [2018-10-04 12:57:18,144 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 12:57:18,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 3.0s impTime 11 [2018-10-04 12:57:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 12:57:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 12:57:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 12:57:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-04 12:57:18,147 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-10-04 12:57:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-04 12:57:18,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 12:57:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-04 12:57:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 12:57:18,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:18,148 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-10-04 12:57:18,148 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:18,148 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-10-04 12:57:18,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:18,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:18,347 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:18,565 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:18,980 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:19,746 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:20,818 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:21,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:21,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:21,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:21,300 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:21,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:21,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:21,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:21,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 12:57:21,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-04 12:57:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-04 12:57:21,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:21,476 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-10-04 12:57:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:21,687 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-04 12:57:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-04 12:57:21,688 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-10-04 12:57:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:21,688 INFO L225 Difference]: With dead ends: 93 [2018-10-04 12:57:21,688 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 12:57:21,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.6s impTime 12 [2018-10-04 12:57:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 12:57:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-04 12:57:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 12:57:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-04 12:57:21,692 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-10-04 12:57:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:21,692 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-04 12:57:21,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-04 12:57:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-04 12:57:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 12:57:21,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:21,693 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-10-04 12:57:21,693 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:21,693 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-10-04 12:57:21,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:21,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:21,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:21,870 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:22,142 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:22,610 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:23,432 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:24,478 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:24,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:24,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:24,835 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:24,917 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2018-10-04 12:57:24,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:24,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:25,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-04 12:57:25,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:57:25,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:57:25,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:25,100 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-10-04 12:57:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:25,767 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-04 12:57:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 12:57:25,767 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-10-04 12:57:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:25,768 INFO L225 Difference]: With dead ends: 94 [2018-10-04 12:57:25,768 INFO L226 Difference]: Without dead ends: 93 [2018-10-04 12:57:25,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 2.7s impTime 13 [2018-10-04 12:57:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-04 12:57:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-04 12:57:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 12:57:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-04 12:57:25,772 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-10-04 12:57:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:25,772 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-04 12:57:25,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:57:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-04 12:57:25,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 12:57:25,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:25,773 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-10-04 12:57:25,773 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:25,773 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:25,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-10-04 12:57:25,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:25,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:25,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:25,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:26,257 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:26,688 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:27,288 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:28,267 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:29,465 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:29,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:29,942 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:29,950 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:30,125 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2018-10-04 12:57:30,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:30,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:30,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:30,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-04 12:57:30,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-04 12:57:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-04 12:57:30,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:30,374 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-10-04 12:57:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:30,634 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-04 12:57:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-04 12:57:30,635 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-10-04 12:57:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:30,636 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:57:30,636 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 12:57:30,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s Time 3.7s impTime 14 [2018-10-04 12:57:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 12:57:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-10-04 12:57:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 12:57:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-04 12:57:30,639 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-10-04 12:57:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:30,639 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-04 12:57:30,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-04 12:57:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-04 12:57:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 12:57:30,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:30,640 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-10-04 12:57:30,640 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:30,640 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-10-04 12:57:30,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:30,833 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:31,526 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:31,819 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:32,795 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:33,995 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:34,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:34,551 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:34,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:34,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:34,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:34,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-04 12:57:34,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 12:57:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 12:57:34,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:34,794 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-10-04 12:57:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:35,059 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-04 12:57:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-04 12:57:35,059 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-10-04 12:57:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:35,060 INFO L225 Difference]: With dead ends: 96 [2018-10-04 12:57:35,060 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 12:57:35,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time 3.5s impTime 15 [2018-10-04 12:57:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 12:57:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-04 12:57:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 12:57:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-04 12:57:35,063 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-10-04 12:57:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:35,063 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-04 12:57:35,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 12:57:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-04 12:57:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-04 12:57:35,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:35,064 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-10-04 12:57:35,064 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:35,064 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-10-04 12:57:35,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:35,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:35,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:35,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:35,282 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:35,663 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:36,539 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:37,486 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:37,717 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:37,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:37,900 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:37,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:57:37,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:57:37,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:37,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:38,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:38,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-04 12:57:38,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 12:57:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 12:57:38,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:38,146 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-10-04 12:57:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:38,318 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-04 12:57:38,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 12:57:38,319 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-10-04 12:57:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:38,319 INFO L225 Difference]: With dead ends: 97 [2018-10-04 12:57:38,319 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 12:57:38,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.4s impTime 16 [2018-10-04 12:57:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 12:57:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 12:57:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 12:57:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-04 12:57:38,321 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-10-04 12:57:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:38,322 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-04 12:57:38,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 12:57:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-04 12:57:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 12:57:38,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:38,322 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-10-04 12:57:38,323 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:38,323 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:38,323 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-10-04 12:57:38,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:38,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:38,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:38,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:38,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:38,552 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:38,743 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:39,055 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:39,693 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:40,575 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:41,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:41,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:41,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:57:41,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-10-04 12:57:41,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:41,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-04 12:57:41,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 12:57:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 12:57:41,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:41,585 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-10-04 12:57:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:41,802 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-04 12:57:41,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 12:57:41,802 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-10-04 12:57:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:41,803 INFO L225 Difference]: With dead ends: 98 [2018-10-04 12:57:41,804 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 12:57:41,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.4s impTime 17 [2018-10-04 12:57:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 12:57:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-10-04 12:57:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 12:57:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 12:57:41,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-10-04 12:57:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:41,807 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 12:57:41,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 12:57:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 12:57:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 12:57:41,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:41,808 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-10-04 12:57:41,808 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:41,808 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-10-04 12:57:41,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:41,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:41,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:41,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:42,129 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:42,494 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:42,768 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:43,752 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:44,965 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:45,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:45,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:57:45,823 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:57:45,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:45,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:46,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:46,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-04 12:57:46,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-04 12:57:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-04 12:57:46,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:46,015 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-10-04 12:57:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:46,283 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-04 12:57:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-04 12:57:46,283 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-10-04 12:57:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:46,284 INFO L225 Difference]: With dead ends: 99 [2018-10-04 12:57:46,284 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 12:57:46,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time 3.5s impTime 18 [2018-10-04 12:57:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 12:57:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-10-04 12:57:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 12:57:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-04 12:57:46,286 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-10-04 12:57:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:46,287 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-04 12:57:46,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-04 12:57:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-04 12:57:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 12:57:46,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:46,288 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-10-04 12:57:46,288 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:46,288 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-10-04 12:57:46,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:46,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:46,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:46,737 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:47,100 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:47,291 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:47,793 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:48,524 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:49,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:49,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:57:49,212 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 12:57:49,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:49,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:49,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:49,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-04 12:57:49,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 12:57:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 12:57:49,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:49,452 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-10-04 12:57:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:49,655 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-04 12:57:49,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-04 12:57:49,656 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-10-04 12:57:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:49,657 INFO L225 Difference]: With dead ends: 100 [2018-10-04 12:57:49,657 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 12:57:49,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.3s impTime 19 [2018-10-04 12:57:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 12:57:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-04 12:57:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-04 12:57:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-04 12:57:49,660 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-10-04 12:57:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:49,660 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-04 12:57:49,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 12:57:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-04 12:57:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 12:57:49,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:49,661 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-10-04 12:57:49,661 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:49,661 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-10-04 12:57:49,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:49,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:49,900 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:50,089 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:50,465 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:51,574 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:52,933 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:53,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:53,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:57:53,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:57:53,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:57:53,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:53,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:53,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-04 12:57:53,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-04 12:57:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-04 12:57:53,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:53,462 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-10-04 12:57:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:53,661 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-04 12:57:53,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-04 12:57:53,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-10-04 12:57:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:53,662 INFO L225 Difference]: With dead ends: 101 [2018-10-04 12:57:53,662 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 12:57:53,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 3.0s impTime 20 [2018-10-04 12:57:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 12:57:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 12:57:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:57:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-04 12:57:53,664 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-10-04 12:57:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:53,664 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-04 12:57:53,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-04 12:57:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-04 12:57:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 12:57:53,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:53,666 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-10-04 12:57:53,666 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:53,666 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-10-04 12:57:53,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:53,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:53,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:57:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:53,878 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:54,260 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:54,830 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:55,777 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:57,206 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:57:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:58,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:57:58,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:57:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:58,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:57:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:57:58,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:57:58,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-04 12:57:58,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 12:57:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 12:57:58,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:57:58,497 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-10-04 12:57:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:57:58,801 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-04 12:57:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-04 12:57:58,801 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-10-04 12:57:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:57:58,802 INFO L225 Difference]: With dead ends: 102 [2018-10-04 12:57:58,802 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 12:57:58,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s Time 4.1s impTime 21 [2018-10-04 12:57:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 12:57:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-04 12:57:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 12:57:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-04 12:57:58,805 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-10-04 12:57:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:57:58,805 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-04 12:57:58,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 12:57:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-04 12:57:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 12:57:58,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:57:58,806 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-10-04 12:57:58,806 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:57:58,806 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:57:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-10-04 12:57:58,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:57:58,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:57:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:57:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:57:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:57:59,016 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:57:59,419 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:57:59,618 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:58:00,038 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:58:00,705 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:58:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:01,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:01,553 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:01,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:58:01,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:58:01,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:01,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:01,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:01,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-04 12:58:01,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 12:58:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 12:58:01,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:01,967 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-10-04 12:58:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:02,201 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-04 12:58:02,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-04 12:58:02,202 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-10-04 12:58:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:02,203 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:58:02,203 INFO L226 Difference]: Without dead ends: 102 [2018-10-04 12:58:02,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.3s impTime 22 [2018-10-04 12:58:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-04 12:58:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-10-04 12:58:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-04 12:58:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-04 12:58:02,207 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-10-04 12:58:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:02,207 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-04 12:58:02,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 12:58:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-04 12:58:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-04 12:58:02,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:02,208 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-10-04 12:58:02,208 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:02,208 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-10-04 12:58:02,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:02,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:02,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:02,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:02,467 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:58:02,883 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:58:03,487 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:58:04,112 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:58:04,428 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:58:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:05,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:05,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:05,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:58:05,266 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-10-04 12:58:05,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:05,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:05,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:05,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-04 12:58:05,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 12:58:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 12:58:05,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:05,467 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-10-04 12:58:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:05,699 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-04 12:58:05,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-04 12:58:05,699 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-10-04 12:58:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:05,700 INFO L225 Difference]: With dead ends: 104 [2018-10-04 12:58:05,700 INFO L226 Difference]: Without dead ends: 103 [2018-10-04 12:58:05,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.5s impTime 23 [2018-10-04 12:58:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-04 12:58:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-04 12:58:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-04 12:58:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-04 12:58:05,704 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-10-04 12:58:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:05,704 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-04 12:58:05,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 12:58:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-04 12:58:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 12:58:05,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:05,705 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-10-04 12:58:05,705 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:05,705 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-10-04 12:58:05,705 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:05,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:05,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:05,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:05,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:06,311 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:58:07,008 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 35 new depth: 35 [2018-10-04 12:58:08,064 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 50 new depth: 50 [2018-10-04 12:58:09,381 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 68 new depth: 68 [2018-10-04 12:58:10,964 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 85 new depth: 85 [2018-10-04 12:58:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:13,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:58:13,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:58:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:58:13,088 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:58:13,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:58:13,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:58:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:13,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:58:13,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-04 12:58:13,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-04 12:58:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-04 12:58:13,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:13,719 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-10-04 12:58:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:20,307 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-04 12:58:20,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 12:58:20,308 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-10-04 12:58:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:20,309 INFO L225 Difference]: With dead ends: 105 [2018-10-04 12:58:20,309 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 12:58:20,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s Time 6.2s impTime 101 [2018-10-04 12:58:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 12:58:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-04 12:58:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 12:58:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-04 12:58:20,316 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-10-04 12:58:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:20,316 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-04 12:58:20,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-04 12:58:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-04 12:58:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 12:58:20,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:58:20,317 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-10-04 12:58:20,317 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:58:20,318 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:58:20,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-10-04 12:58:20,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:58:20,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:58:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:20,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:58:20,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:58:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:58:21,018 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:58:21,249 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:58:22,152 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:58:22,525 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:58:23,480 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:58:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:58:23,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:58:23,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-04 12:58:23,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 12:58:23,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 12:58:23,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:58:23,824 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-10-04 12:58:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:58:24,091 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-04 12:58:24,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 12:58:24,091 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-10-04 12:58:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:58:24,092 INFO L225 Difference]: With dead ends: 104 [2018-10-04 12:58:24,092 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:58:24,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 2.1s impTime 24 [2018-10-04 12:58:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:58:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:58:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:58:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:58:24,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-10-04 12:58:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:58:24,095 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:58:24,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 12:58:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:58:24,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:58:24,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:58:24,306 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 613 [2018-10-04 12:58:29,222 WARN L178 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 613 DAG size of output: 610 [2018-10-04 12:58:29,231 INFO L425 ceAbstractionStarter]: For program point mainENTRY(lines 17 31) no Hoare annotation was computed. [2018-10-04 12:58:29,231 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 17 31) no Hoare annotation was computed. [2018-10-04 12:58:29,231 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 17 31) no Hoare annotation was computed. [2018-10-04 12:58:29,233 INFO L421 ceAbstractionStarter]: At program point L24-1(lines 24 27) the Hoare annotation is: (or (and (<= 8 main_y) (<= main_y 8) (<= main_x 8) (<= 8 main_x)) (and (<= main_x 49) (<= main_y 49) (<= 49 main_x) (<= 49 main_y)) (and (<= 99 main_x) (<= main_y 99) (<= 99 main_y) (<= main_x 99)) (and (<= 42 main_x) (<= main_y 42) (<= main_x 42) (<= 42 main_y)) (and (<= 9 main_y) (<= 9 main_x) (<= main_x 9) (<= main_y 9)) (and (<= 59 main_x) (<= 59 main_y) (<= main_y 59) (<= main_x 59)) (and (<= 55 main_y) (<= main_y 55) (<= 55 main_x) (<= main_x 55)) (and (<= 74 main_x) (<= main_x 74) (<= 74 main_y) (<= main_y 74)) (and (<= main_x 97) (<= 97 main_y) (<= main_y 97) (<= 97 main_x)) (and (<= 12 main_x) (<= 12 main_y) (<= main_y 12) (<= main_x 12)) (and (<= main_x 65) (<= main_y 65) (<= 65 main_x) (<= 65 main_y)) (and (<= 32 main_x) (<= main_x 32) (<= 32 main_y) (<= main_y 32)) (and (<= main_y 73) (<= main_x 73) (<= 73 main_x) (<= 73 main_y)) (and (<= 6 main_x) (<= main_x 6) (<= 6 main_y) (<= main_y 6)) (and (<= 14 main_x) (<= 14 main_y) (<= main_y 14) (<= main_x 14)) (and (<= main_x 0) (<= 0 main_y) (<= 0 main_x) (<= main_y 0)) (and (<= main_y 44) (<= main_x 44) (<= 44 main_y) (<= 44 main_x)) (and (<= 38 main_x) (<= 38 main_y) (<= main_y 38) (<= main_x 38)) (and (<= 43 main_x) (<= main_x 43) (<= main_y 43) (<= 43 main_y)) (and (<= 21 main_y) (<= 21 main_x) (<= main_x 21) (<= main_y 21)) (and (<= 94 main_x) (<= 94 main_y) (<= main_x 94) (<= main_y 94)) (and (<= 52 main_x) (<= 52 main_y) (<= main_y 52) (<= main_x 52)) (and (<= main_y 46) (<= 46 main_x) (<= main_x 46) (<= 46 main_y)) (and (<= main_x 18) (<= 18 main_y) (<= 18 main_x) (<= main_y 18)) (<= 101 main_x) (and (<= 61 main_y) (<= main_x 61) (<= main_y 61) (<= 61 main_x)) (and (<= 88 main_y) (<= main_y 88) (<= 88 main_x) (<= main_x 88)) (and (<= 80 main_y) (<= main_x 80) (<= main_y 80) (<= 80 main_x)) (and (<= main_x 92) (<= 92 main_y) (<= main_y 92) (<= 92 main_x)) (and (<= 87 main_x) (<= main_x 87) (<= 87 main_y) (<= main_y 87)) (and (<= 35 main_y) (<= main_y 35) (<= main_x 35) (<= 35 main_x)) (and (<= 85 main_x) (<= main_x 85) (<= 85 main_y) (<= main_y 85)) (and (<= 63 main_x) (<= 63 main_y) (<= main_y 63) (<= main_x 63)) (and (<= 15 main_y) (<= main_y 15) (<= 15 main_x) (<= main_x 15)) (and (<= main_y 64) (<= 64 main_x) (<= main_x 64) (<= 64 main_y)) (and (<= 4 main_y) (<= main_y 4) (<= main_x 4) (<= 4 main_x)) (and (<= 47 main_x) (<= 47 main_y) (<= main_y 47) (<= main_x 47)) (and (<= 51 main_y) (<= main_x 51) (<= 51 main_x) (<= main_y 51)) (and (<= 54 main_y) (<= main_y 54) (<= 54 main_x) (<= main_x 54)) (and (<= main_x 33) (<= 33 main_x) (<= main_y 33) (<= 33 main_y)) (and (<= 37 main_x) (<= 37 main_y) (<= main_y 37) (<= main_x 37)) (and (<= 20 main_y) (<= 20 main_x) (<= main_y 20) (<= main_x 20)) (and (<= 26 main_y) (<= main_x 26) (<= 26 main_x) (<= main_y 26)) (and (<= 86 main_x) (<= 86 main_y) (<= main_x 86) (<= main_y 86)) (and (<= main_x 27) (<= main_y 27) (<= 27 main_y) (<= 27 main_x)) (and (<= main_y 95) (<= 95 main_x) (<= 95 main_y) (<= main_x 95)) (and (<= 1 main_x) (<= main_x 1) (<= main_y 1) (<= 1 main_y)) (and (<= main_x 56) (<= 56 main_x) (<= 56 main_y) (<= main_y 56)) (and (<= main_y 75) (<= main_x 75) (<= 75 main_y) (<= 75 main_x)) (and (<= 68 main_y) (<= main_x 68) (<= main_y 68) (<= 68 main_x)) (and (<= main_x 62) (<= 62 main_x) (<= 62 main_y) (<= main_y 62)) (and (<= main_y 78) (<= 78 main_x) (<= 78 main_y) (<= main_x 78)) (and (<= main_y 3) (<= 3 main_y) (<= 3 main_x) (<= main_x 3)) (and (<= main_x 25) (<= main_y 25) (<= 25 main_x) (<= 25 main_y)) (and (<= main_x 36) (<= main_y 36) (<= 36 main_x) (<= 36 main_y)) (and (<= 57 main_y) (<= main_x 57) (<= main_y 57) (<= 57 main_x)) (and (<= 5 main_x) (<= main_x 5) (<= main_y 5) (<= 5 main_y)) (and (<= 82 main_x) (<= 82 main_y) (<= main_x 82) (<= main_y 82)) (and (<= main_y 17) (<= 17 main_y) (<= 17 main_x) (<= main_x 17)) (and (<= main_y 83) (<= 83 main_x) (<= main_x 83) (<= 83 main_y)) (and (<= 77 main_x) (<= 77 main_y) (<= main_x 77) (<= main_y 77)) (and (<= 31 main_x) (<= 31 main_y) (<= main_y 31) (<= main_x 31)) (and (<= main_y 98) (<= main_x 98) (<= 98 main_y) (<= 98 main_x)) (and (<= 71 main_y) (<= 71 main_x) (<= main_y 71) (<= main_x 71)) (and (<= main_y 41) (<= 41 main_x) (<= 41 main_y) (<= main_x 41)) (and (<= 30 main_x) (<= 30 main_y) (<= main_x 30) (<= main_y 30)) (and (<= 24 main_y) (<= main_x 24) (<= main_y 24) (<= 24 main_x)) (and (<= main_y 50) (<= 50 main_y) (<= main_x 50) (<= 50 main_x)) (and (<= 84 main_y) (<= main_y 84) (<= main_x 84) (<= 84 main_x)) (and (<= main_y 93) (<= 93 main_y) (<= 93 main_x) (<= main_x 93)) (and (<= main_y 60) (<= main_x 60) (<= 60 main_y) (<= 60 main_x)) (and (<= 29 main_y) (<= main_x 29) (<= 29 main_x) (<= main_y 29)) (and (<= main_y 40) (<= main_x 40) (<= 40 main_y) (<= 40 main_x)) (and (<= main_y 53) (<= 53 main_y) (<= main_x 53) (<= 53 main_x)) (and (<= main_y 58) (<= 58 main_y) (<= 58 main_x) (<= main_x 58)) (and (<= 67 main_x) (<= 67 main_y) (<= main_y 67) (<= main_x 67)) (and (<= main_y 22) (<= main_x 22) (<= 22 main_x) (<= 22 main_y)) (and (<= 39 main_y) (<= 39 main_x) (<= main_x 39) (<= main_y 39)) (and (<= 13 main_x) (<= main_x 13) (<= main_y 13) (<= 13 main_y)) (and (<= main_y 100) (< 99 main_y) (<= 100 main_x)) (and (<= main_y 79) (<= 79 main_x) (<= main_x 79) (<= 79 main_y)) (and (<= 69 main_x) (<= main_x 69) (<= 69 main_y) (<= main_y 69)) (and (<= 81 main_x) (<= main_y 81) (<= main_x 81) (<= 81 main_y)) (and (<= 28 main_y) (<= main_x 28) (<= 28 main_x) (<= main_y 28)) (and (<= main_x 91) (<= 91 main_y) (<= 91 main_x) (<= main_y 91)) (and (<= main_y 66) (<= main_x 66) (<= 66 main_x) (<= 66 main_y)) (and (<= 34 main_x) (<= main_y 34) (<= main_x 34) (<= 34 main_y)) (and (<= 89 main_x) (<= main_y 89) (<= main_x 89) (<= 89 main_y)) (and (<= 10 main_y) (<= main_x 10) (<= main_y 10) (<= 10 main_x)) (and (<= main_x 16) (<= main_y 16) (<= 16 main_x) (<= 16 main_y)) (and (<= 2 main_y) (<= 2 main_x) (<= main_y 2) (<= main_x 2)) (and (<= main_x 7) (<= 7 main_y) (<= 7 main_x) (<= main_y 7)) (and (<= main_x 72) (<= 72 main_x) (<= 72 main_y) (<= main_y 72)) (and (<= 48 main_x) (<= main_x 48) (<= main_y 48) (<= 48 main_y)) (and (<= main_y 76) (<= main_x 76) (<= 76 main_y) (<= 76 main_x)) (and (<= 96 main_x) (<= main_y 96) (<= 96 main_y) (<= main_x 96)) (and (<= 45 main_x) (<= 45 main_y) (<= main_y 45) (<= main_x 45)) (and (<= 11 main_x) (<= main_x 11) (<= 11 main_y) (<= main_y 11)) (and (<= 90 main_x) (<= main_y 90) (<= 90 main_y) (<= main_x 90)) (and (<= main_x 19) (<= main_y 19) (<= 19 main_x) (<= 19 main_y)) (and (<= main_x 70) (<= main_y 70) (<= 70 main_x) (<= 70 main_y)) (and (<= 23 main_x) (<= 23 main_y) (<= main_y 23) (<= main_x 23))) [2018-10-04 12:58:29,233 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 29) no Hoare annotation was computed. [2018-10-04 12:58:29,265 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:58:29 BoogieIcfgContainer [2018-10-04 12:58:29,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:58:29,267 INFO L168 Benchmark]: Toolchain (without parser) took 213597.76 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.9 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 314.3 MB). Peak memory consumption was 588.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:58:29,268 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:58:29,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:58:29,268 INFO L168 Benchmark]: Boogie Preprocessor took 23.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:58:29,269 INFO L168 Benchmark]: RCFGBuilder took 234.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:58:29,269 INFO L168 Benchmark]: TraceAbstraction took 213294.14 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.9 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 293.1 MB). Peak memory consumption was 566.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:58:29,272 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 234.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 213294.14 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.9 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 293.1 MB). Peak memory consumption was 566.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((8 <= y && y <= 8) && x <= 8) && 8 <= x) || (((x <= 49 && y <= 49) && 49 <= x) && 49 <= y)) || (((99 <= x && y <= 99) && 99 <= y) && x <= 99)) || (((42 <= x && y <= 42) && x <= 42) && 42 <= y)) || (((9 <= y && 9 <= x) && x <= 9) && y <= 9)) || (((59 <= x && 59 <= y) && y <= 59) && x <= 59)) || (((55 <= y && y <= 55) && 55 <= x) && x <= 55)) || (((74 <= x && x <= 74) && 74 <= y) && y <= 74)) || (((x <= 97 && 97 <= y) && y <= 97) && 97 <= x)) || (((12 <= x && 12 <= y) && y <= 12) && x <= 12)) || (((x <= 65 && y <= 65) && 65 <= x) && 65 <= y)) || (((32 <= x && x <= 32) && 32 <= y) && y <= 32)) || (((y <= 73 && x <= 73) && 73 <= x) && 73 <= y)) || (((6 <= x && x <= 6) && 6 <= y) && y <= 6)) || (((14 <= x && 14 <= y) && y <= 14) && x <= 14)) || (((x <= 0 && 0 <= y) && 0 <= x) && y <= 0)) || (((y <= 44 && x <= 44) && 44 <= y) && 44 <= x)) || (((38 <= x && 38 <= y) && y <= 38) && x <= 38)) || (((43 <= x && x <= 43) && y <= 43) && 43 <= y)) || (((21 <= y && 21 <= x) && x <= 21) && y <= 21)) || (((94 <= x && 94 <= y) && x <= 94) && y <= 94)) || (((52 <= x && 52 <= y) && y <= 52) && x <= 52)) || (((y <= 46 && 46 <= x) && x <= 46) && 46 <= y)) || (((x <= 18 && 18 <= y) && 18 <= x) && y <= 18)) || 101 <= x) || (((61 <= y && x <= 61) && y <= 61) && 61 <= x)) || (((88 <= y && y <= 88) && 88 <= x) && x <= 88)) || (((80 <= y && x <= 80) && y <= 80) && 80 <= x)) || (((x <= 92 && 92 <= y) && y <= 92) && 92 <= x)) || (((87 <= x && x <= 87) && 87 <= y) && y <= 87)) || (((35 <= y && y <= 35) && x <= 35) && 35 <= x)) || (((85 <= x && x <= 85) && 85 <= y) && y <= 85)) || (((63 <= x && 63 <= y) && y <= 63) && x <= 63)) || (((15 <= y && y <= 15) && 15 <= x) && x <= 15)) || (((y <= 64 && 64 <= x) && x <= 64) && 64 <= y)) || (((4 <= y && y <= 4) && x <= 4) && 4 <= x)) || (((47 <= x && 47 <= y) && y <= 47) && x <= 47)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((54 <= y && y <= 54) && 54 <= x) && x <= 54)) || (((x <= 33 && 33 <= x) && y <= 33) && 33 <= y)) || (((37 <= x && 37 <= y) && y <= 37) && x <= 37)) || (((20 <= y && 20 <= x) && y <= 20) && x <= 20)) || (((26 <= y && x <= 26) && 26 <= x) && y <= 26)) || (((86 <= x && 86 <= y) && x <= 86) && y <= 86)) || (((x <= 27 && y <= 27) && 27 <= y) && 27 <= x)) || (((y <= 95 && 95 <= x) && 95 <= y) && x <= 95)) || (((1 <= x && x <= 1) && y <= 1) && 1 <= y)) || (((x <= 56 && 56 <= x) && 56 <= y) && y <= 56)) || (((y <= 75 && x <= 75) && 75 <= y) && 75 <= x)) || (((68 <= y && x <= 68) && y <= 68) && 68 <= x)) || (((x <= 62 && 62 <= x) && 62 <= y) && y <= 62)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 3 && 3 <= y) && 3 <= x) && x <= 3)) || (((x <= 25 && y <= 25) && 25 <= x) && 25 <= y)) || (((x <= 36 && y <= 36) && 36 <= x) && 36 <= y)) || (((57 <= y && x <= 57) && y <= 57) && 57 <= x)) || (((5 <= x && x <= 5) && y <= 5) && 5 <= y)) || (((82 <= x && 82 <= y) && x <= 82) && y <= 82)) || (((y <= 17 && 17 <= y) && 17 <= x) && x <= 17)) || (((y <= 83 && 83 <= x) && x <= 83) && 83 <= y)) || (((77 <= x && 77 <= y) && x <= 77) && y <= 77)) || (((31 <= x && 31 <= y) && y <= 31) && x <= 31)) || (((y <= 98 && x <= 98) && 98 <= y) && 98 <= x)) || (((71 <= y && 71 <= x) && y <= 71) && x <= 71)) || (((y <= 41 && 41 <= x) && 41 <= y) && x <= 41)) || (((30 <= x && 30 <= y) && x <= 30) && y <= 30)) || (((24 <= y && x <= 24) && y <= 24) && 24 <= x)) || (((y <= 50 && 50 <= y) && x <= 50) && 50 <= x)) || (((84 <= y && y <= 84) && x <= 84) && 84 <= x)) || (((y <= 93 && 93 <= y) && 93 <= x) && x <= 93)) || (((y <= 60 && x <= 60) && 60 <= y) && 60 <= x)) || (((29 <= y && x <= 29) && 29 <= x) && y <= 29)) || (((y <= 40 && x <= 40) && 40 <= y) && 40 <= x)) || (((y <= 53 && 53 <= y) && x <= 53) && 53 <= x)) || (((y <= 58 && 58 <= y) && 58 <= x) && x <= 58)) || (((67 <= x && 67 <= y) && y <= 67) && x <= 67)) || (((y <= 22 && x <= 22) && 22 <= x) && 22 <= y)) || (((39 <= y && 39 <= x) && x <= 39) && y <= 39)) || (((13 <= x && x <= 13) && y <= 13) && 13 <= y)) || ((y <= 100 && 99 < y) && 100 <= x)) || (((y <= 79 && 79 <= x) && x <= 79) && 79 <= y)) || (((69 <= x && x <= 69) && 69 <= y) && y <= 69)) || (((81 <= x && y <= 81) && x <= 81) && 81 <= y)) || (((28 <= y && x <= 28) && 28 <= x) && y <= 28)) || (((x <= 91 && 91 <= y) && 91 <= x) && y <= 91)) || (((y <= 66 && x <= 66) && 66 <= x) && 66 <= y)) || (((34 <= x && y <= 34) && x <= 34) && 34 <= y)) || (((89 <= x && y <= 89) && x <= 89) && 89 <= y)) || (((10 <= y && x <= 10) && y <= 10) && 10 <= x)) || (((x <= 16 && y <= 16) && 16 <= x) && 16 <= y)) || (((2 <= y && 2 <= x) && y <= 2) && x <= 2)) || (((x <= 7 && 7 <= y) && 7 <= x) && y <= 7)) || (((x <= 72 && 72 <= x) && 72 <= y) && y <= 72)) || (((48 <= x && x <= 48) && y <= 48) && 48 <= y)) || (((y <= 76 && x <= 76) && 76 <= y) && 76 <= x)) || (((96 <= x && y <= 96) && 96 <= y) && x <= 96)) || (((45 <= x && 45 <= y) && y <= 45) && x <= 45)) || (((11 <= x && x <= 11) && 11 <= y) && y <= 11)) || (((90 <= x && y <= 90) && 90 <= y) && x <= 90)) || (((x <= 19 && y <= 19) && 19 <= x) && 19 <= y)) || (((x <= 70 && y <= 70) && 70 <= x) && 70 <= y)) || (((23 <= x && 23 <= y) && y <= 23) && x <= 23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 213.1s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 21.3s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 19537 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10403 GetRequests, 5148 SyntacticMatches, 2 SemanticMatches, 5253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 172.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=101, 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, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1314 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 176.6s InterpolantComputationTime, 10605 NumberOfCodeBlocks, 10605 NumberOfCodeBlocksAsserted, 1494 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 2205739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 21100 ConjunctsInSsa, 5351 ConjunctsInUnsatCore, 202 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/348551 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-58-29-290.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-58-29-290.csv Received shutdown request...