java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-00a8621
[2018-09-30 10:34:28,048 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-09-30 10:34:28,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-09-30 10:34:28,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-09-30 10:34:28,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-09-30 10:34:28,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-09-30 10:34:28,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-09-30 10:34:28,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-09-30 10:34:28,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-09-30 10:34:28,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-09-30 10:34:28,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-09-30 10:34:28,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-09-30 10:34:28,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-09-30 10:34:28,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-09-30 10:34:28,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-09-30 10:34:28,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-09-30 10:34:28,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-09-30 10:34:28,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-09-30 10:34:28,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-09-30 10:34:28,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-09-30 10:34:28,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-09-30 10:34:28,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-09-30 10:34:28,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-09-30 10:34:28,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-09-30 10:34:28,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-09-30 10:34:28,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-09-30 10:34:28,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-09-30 10:34:28,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-09-30 10:34:28,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-09-30 10:34:28,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-09-30 10:34:28,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-09-30 10:34:28,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-09-30 10:34:28,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-09-30 10:34:28,098 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-09-30 10:34:28,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-09-30 10:34:28,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-09-30 10:34:28,100 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf
[2018-09-30 10:34:28,118 INFO L110 SettingsManager]: Loading preferences was successful
[2018-09-30 10:34:28,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-09-30 10:34:28,120 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-09-30 10:34:28,120 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-09-30 10:34:28,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-09-30 10:34:28,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-09-30 10:34:28,121 INFO L133 SettingsManager]: * Use SBE=true
[2018-09-30 10:34:28,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-09-30 10:34:28,122 INFO L133 SettingsManager]: * sizeof long=4
[2018-09-30 10:34:28,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-09-30 10:34:28,123 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-09-30 10:34:28,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-09-30 10:34:28,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-09-30 10:34:28,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-09-30 10:34:28,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-09-30 10:34:28,124 INFO L133 SettingsManager]: * sizeof long double=12
[2018-09-30 10:34:28,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-09-30 10:34:28,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-09-30 10:34:28,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-09-30 10:34:28,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-09-30 10:34:28,125 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-09-30 10:34:28,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-09-30 10:34:28,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-09-30 10:34:28,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-09-30 10:34:28,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-09-30 10:34:28,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-09-30 10:34:28,126 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-09-30 10:34:28,128 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-09-30 10:34:28,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-09-30 10:34:28,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-09-30 10:34:28,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-09-30 10:34:28,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-09-30 10:34:28,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-09-30 10:34:28,207 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-09-30 10:34:28,208 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2018-09-30 10:34:28,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl
[2018-09-30 10:34:28,209 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl'
[2018-09-30 10:34:28,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-09-30 10:34:28,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-09-30 10:34:28,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-09-30 10:34:28,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-09-30 10:34:28,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-09-30 10:34:28,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,312 WARN L165 Inliner]: Program contained no entry procedure!
[2018-09-30 10:34:28,313 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start]
[2018-09-30 10:34:28,313 WARN L175 Inliner]: Fallback enabled. All procedures will be processed.
[2018-09-30 10:34:28,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-09-30 10:34:28,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-09-30 10:34:28,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-09-30 10:34:28,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-09-30 10:34:28,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
[2018-09-30 10:34:28,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-09-30 10:34:28,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-09-30 10:34:28,355 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-09-30 10:34:28,355 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-09-30 10:34:28,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-09-30 10:34:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2018-09-30 10:34:28,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2018-09-30 10:34:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc
[2018-09-30 10:34:28,701 INFO L345 CfgBuilder]: Using library mode
[2018-09-30 10:34:28,702 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:28 BoogieIcfgContainer
[2018-09-30 10:34:28,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-09-30 10:34:28,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-09-30 10:34:28,704 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-09-30 10:34:28,707 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-09-30 10:34:28,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:28" (1/2) ...
[2018-09-30 10:34:28,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526ff50b and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:34:28, skipping insertion in model container
[2018-09-30 10:34:28,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:28" (2/2) ...
[2018-09-30 10:34:28,711 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl
[2018-09-30 10:34:28,721 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-09-30 10:34:28,729 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-09-30 10:34:28,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation
[2018-09-30 10:34:28,781 INFO L381 AbstractCegarLoop]: Interprodecural is true
[2018-09-30 10:34:28,781 INFO L382 AbstractCegarLoop]: Hoare is true
[2018-09-30 10:34:28,782 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-09-30 10:34:28,782 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-09-30 10:34:28,782 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-09-30 10:34:28,782 INFO L386 AbstractCegarLoop]: Difference is false
[2018-09-30 10:34:28,782 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-09-30 10:34:28,782 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-09-30 10:34:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states.
[2018-09-30 10:34:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2018-09-30 10:34:28,804 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:28,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2018-09-30 10:34:28,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:28,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times
[2018-09-30 10:34:28,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:28,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:28,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:28,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:28,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:29,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:34:29,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2018-09-30 10:34:29,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:34:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:34:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:34:29,053 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states.
[2018-09-30 10:34:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:29,168 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions.
[2018-09-30 10:34:29,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-09-30 10:34:29,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4
[2018-09-30 10:34:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:29,184 INFO L225 Difference]: With dead ends: 17
[2018-09-30 10:34:29,184 INFO L226 Difference]: Without dead ends: 10
[2018-09-30 10:34:29,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:34:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states.
[2018-09-30 10:34:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9.
[2018-09-30 10:34:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2018-09-30 10:34:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2018-09-30 10:34:29,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4
[2018-09-30 10:34:29,228 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:29,228 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2018-09-30 10:34:29,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:34:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2018-09-30 10:34:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-09-30 10:34:29,229 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:29,229 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1]
[2018-09-30 10:34:29,230 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:29,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times
[2018-09-30 10:34:29,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:29,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:29,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:29,409 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:29,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:29,480 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:29,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:29,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:29,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:29,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:29,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:29,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4
[2018-09-30 10:34:29,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-09-30 10:34:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-09-30 10:34:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-09-30 10:34:29,690 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states.
[2018-09-30 10:34:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:29,812 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2018-09-30 10:34:29,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-09-30 10:34:29,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8
[2018-09-30 10:34:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:29,814 INFO L225 Difference]: With dead ends: 15
[2018-09-30 10:34:29,814 INFO L226 Difference]: Without dead ends: 14
[2018-09-30 10:34:29,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-09-30 10:34:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2018-09-30 10:34:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13.
[2018-09-30 10:34:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2018-09-30 10:34:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions.
[2018-09-30 10:34:29,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8
[2018-09-30 10:34:29,820 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:29,820 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions.
[2018-09-30 10:34:29,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-09-30 10:34:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2018-09-30 10:34:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-09-30 10:34:29,821 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:29,821 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1]
[2018-09-30 10:34:29,821 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:29,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times
[2018-09-30 10:34:29,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:29,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:30,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:30,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:30,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:34:30,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:34:30,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:30,091 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:30,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:30,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:30,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:30,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:30,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:30,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6
[2018-09-30 10:34:30,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-09-30 10:34:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-09-30 10:34:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2018-09-30 10:34:30,313 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states.
[2018-09-30 10:34:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:30,440 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions.
[2018-09-30 10:34:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-09-30 10:34:30,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-09-30 10:34:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:30,443 INFO L225 Difference]: With dead ends: 19
[2018-09-30 10:34:30,443 INFO L226 Difference]: Without dead ends: 18
[2018-09-30 10:34:30,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2018-09-30 10:34:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2018-09-30 10:34:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17.
[2018-09-30 10:34:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2018-09-30 10:34:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions.
[2018-09-30 10:34:30,449 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12
[2018-09-30 10:34:30,449 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:30,449 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions.
[2018-09-30 10:34:30,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-09-30 10:34:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions.
[2018-09-30 10:34:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-09-30 10:34:30,450 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:30,451 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1]
[2018-09-30 10:34:30,451 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:30,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times
[2018-09-30 10:34:30,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:30,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:30,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:30,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:30,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:30,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:30,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:30,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:34:30,669 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2018-09-30 10:34:30,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:30,672 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:30,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:30,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:30,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:30,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:30,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:30,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8
[2018-09-30 10:34:30,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-09-30 10:34:30,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-09-30 10:34:30,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2018-09-30 10:34:30,948 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states.
[2018-09-30 10:34:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:31,021 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions.
[2018-09-30 10:34:31,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-09-30 10:34:31,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16
[2018-09-30 10:34:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:31,022 INFO L225 Difference]: With dead ends: 23
[2018-09-30 10:34:31,022 INFO L226 Difference]: Without dead ends: 22
[2018-09-30 10:34:31,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2018-09-30 10:34:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2018-09-30 10:34:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21.
[2018-09-30 10:34:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2018-09-30 10:34:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions.
[2018-09-30 10:34:31,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16
[2018-09-30 10:34:31,029 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:31,029 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions.
[2018-09-30 10:34:31,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-09-30 10:34:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions.
[2018-09-30 10:34:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-09-30 10:34:31,030 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:31,030 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1]
[2018-09-30 10:34:31,031 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:31,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times
[2018-09-30 10:34:31,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:31,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:31,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:31,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:31,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:31,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:34:31,246 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:34:31,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:31,248 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:31,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:31,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:31,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:31,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:31,665 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:31,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10
[2018-09-30 10:34:31,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-09-30 10:34:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-09-30 10:34:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132
[2018-09-30 10:34:31,668 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states.
[2018-09-30 10:34:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:31,752 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions.
[2018-09-30 10:34:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-09-30 10:34:31,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20
[2018-09-30 10:34:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:31,753 INFO L225 Difference]: With dead ends: 27
[2018-09-30 10:34:31,753 INFO L226 Difference]: Without dead ends: 26
[2018-09-30 10:34:31,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132
[2018-09-30 10:34:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2018-09-30 10:34:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25.
[2018-09-30 10:34:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2018-09-30 10:34:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions.
[2018-09-30 10:34:31,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20
[2018-09-30 10:34:31,760 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:31,760 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions.
[2018-09-30 10:34:31,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-09-30 10:34:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions.
[2018-09-30 10:34:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-09-30 10:34:31,761 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:31,761 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1]
[2018-09-30 10:34:31,762 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:31,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:31,762 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times
[2018-09-30 10:34:31,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:31,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:31,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:31,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:31,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:31,942 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:31,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:31,952 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:34:31,973 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2018-09-30 10:34:31,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:31,977 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:31,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:31,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:31,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:31,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:32,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:32,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12
[2018-09-30 10:34:32,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-09-30 10:34:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-09-30 10:34:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182
[2018-09-30 10:34:32,139 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states.
[2018-09-30 10:34:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:32,191 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions.
[2018-09-30 10:34:32,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-09-30 10:34:32,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24
[2018-09-30 10:34:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:32,198 INFO L225 Difference]: With dead ends: 31
[2018-09-30 10:34:32,198 INFO L226 Difference]: Without dead ends: 30
[2018-09-30 10:34:32,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182
[2018-09-30 10:34:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-09-30 10:34:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29.
[2018-09-30 10:34:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2018-09-30 10:34:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions.
[2018-09-30 10:34:32,204 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24
[2018-09-30 10:34:32,204 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:32,204 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions.
[2018-09-30 10:34:32,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-09-30 10:34:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions.
[2018-09-30 10:34:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-09-30 10:34:32,205 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:32,206 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1]
[2018-09-30 10:34:32,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:32,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times
[2018-09-30 10:34:32,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:32,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:32,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:32,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:32,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:34:32,502 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2018-09-30 10:34:32,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:32,505 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:32,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:32,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:32,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:32,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:32,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:32,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14
[2018-09-30 10:34:32,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-09-30 10:34:32,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-09-30 10:34:32,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240
[2018-09-30 10:34:32,751 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states.
[2018-09-30 10:34:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:32,836 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions.
[2018-09-30 10:34:32,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-09-30 10:34:32,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28
[2018-09-30 10:34:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:32,838 INFO L225 Difference]: With dead ends: 35
[2018-09-30 10:34:32,839 INFO L226 Difference]: Without dead ends: 34
[2018-09-30 10:34:32,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240
[2018-09-30 10:34:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-09-30 10:34:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33.
[2018-09-30 10:34:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2018-09-30 10:34:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions.
[2018-09-30 10:34:32,845 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28
[2018-09-30 10:34:32,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:32,846 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions.
[2018-09-30 10:34:32,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-09-30 10:34:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions.
[2018-09-30 10:34:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-09-30 10:34:32,847 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:32,847 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1]
[2018-09-30 10:34:32,847 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:32,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times
[2018-09-30 10:34:32,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:32,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:32,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:32,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:32,981 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:32,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:33,018 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:33,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:33,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:33,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:33,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:33,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:33,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16
[2018-09-30 10:34:33,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-09-30 10:34:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-09-30 10:34:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306
[2018-09-30 10:34:33,259 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states.
[2018-09-30 10:34:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:33,491 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions.
[2018-09-30 10:34:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-09-30 10:34:33,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32
[2018-09-30 10:34:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:33,494 INFO L225 Difference]: With dead ends: 39
[2018-09-30 10:34:33,494 INFO L226 Difference]: Without dead ends: 38
[2018-09-30 10:34:33,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306
[2018-09-30 10:34:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2018-09-30 10:34:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37.
[2018-09-30 10:34:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2018-09-30 10:34:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions.
[2018-09-30 10:34:33,510 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32
[2018-09-30 10:34:33,510 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:33,510 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions.
[2018-09-30 10:34:33,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-09-30 10:34:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions.
[2018-09-30 10:34:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-09-30 10:34:33,513 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:33,516 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1]
[2018-09-30 10:34:33,516 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:33,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times
[2018-09-30 10:34:33,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:33,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:33,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:33,768 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:33,769 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:33,769 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:34:33,798 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:34:33,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:33,801 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:33,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:33,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:33,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:33,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:34,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:34,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18
[2018-09-30 10:34:34,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-09-30 10:34:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-09-30 10:34:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380
[2018-09-30 10:34:34,097 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states.
[2018-09-30 10:34:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:34,200 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions.
[2018-09-30 10:34:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-09-30 10:34:34,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36
[2018-09-30 10:34:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:34,202 INFO L225 Difference]: With dead ends: 43
[2018-09-30 10:34:34,202 INFO L226 Difference]: Without dead ends: 42
[2018-09-30 10:34:34,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380
[2018-09-30 10:34:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2018-09-30 10:34:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41.
[2018-09-30 10:34:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2018-09-30 10:34:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions.
[2018-09-30 10:34:34,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36
[2018-09-30 10:34:34,209 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:34,209 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions.
[2018-09-30 10:34:34,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-09-30 10:34:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions.
[2018-09-30 10:34:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-09-30 10:34:34,210 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:34,211 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1]
[2018-09-30 10:34:34,211 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:34,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times
[2018-09-30 10:34:34,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:34,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:34,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:34,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:34:34,441 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s)
[2018-09-30 10:34:34,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:34,445 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:34,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:34,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:34,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:34,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:34,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:34,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20
[2018-09-30 10:34:34,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-09-30 10:34:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-09-30 10:34:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462
[2018-09-30 10:34:34,691 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states.
[2018-09-30 10:34:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:34,995 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions.
[2018-09-30 10:34:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-09-30 10:34:34,995 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40
[2018-09-30 10:34:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:34,997 INFO L225 Difference]: With dead ends: 47
[2018-09-30 10:34:34,997 INFO L226 Difference]: Without dead ends: 46
[2018-09-30 10:34:34,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462
[2018-09-30 10:34:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-09-30 10:34:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45.
[2018-09-30 10:34:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2018-09-30 10:34:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions.
[2018-09-30 10:34:35,005 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40
[2018-09-30 10:34:35,005 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:35,005 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions.
[2018-09-30 10:34:35,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-09-30 10:34:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions.
[2018-09-30 10:34:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2018-09-30 10:34:35,006 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:35,007 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1]
[2018-09-30 10:34:35,007 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:35,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times
[2018-09-30 10:34:35,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:35,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:35,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:35,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:35,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:34:35,879 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:34:35,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:35,887 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:35,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:35,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:35,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:35,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:36,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:36,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22
[2018-09-30 10:34:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-09-30 10:34:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-09-30 10:34:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552
[2018-09-30 10:34:36,218 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states.
[2018-09-30 10:34:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:36,360 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions.
[2018-09-30 10:34:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-09-30 10:34:36,360 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44
[2018-09-30 10:34:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:36,362 INFO L225 Difference]: With dead ends: 51
[2018-09-30 10:34:36,362 INFO L226 Difference]: Without dead ends: 50
[2018-09-30 10:34:36,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552
[2018-09-30 10:34:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-09-30 10:34:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49.
[2018-09-30 10:34:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-09-30 10:34:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions.
[2018-09-30 10:34:36,367 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44
[2018-09-30 10:34:36,367 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:36,368 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions.
[2018-09-30 10:34:36,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-09-30 10:34:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions.
[2018-09-30 10:34:36,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-09-30 10:34:36,369 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:36,369 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1]
[2018-09-30 10:34:36,369 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:36,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:36,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times
[2018-09-30 10:34:36,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:36,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:36,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:36,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:36,848 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:36,856 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:34:36,935 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s)
[2018-09-30 10:34:36,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:36,938 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:36,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:36,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:36,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:36,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:37,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:37,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24
[2018-09-30 10:34:37,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-09-30 10:34:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-09-30 10:34:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650
[2018-09-30 10:34:37,353 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states.
[2018-09-30 10:34:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:37,454 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions.
[2018-09-30 10:34:37,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-09-30 10:34:37,455 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48
[2018-09-30 10:34:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:37,456 INFO L225 Difference]: With dead ends: 55
[2018-09-30 10:34:37,456 INFO L226 Difference]: Without dead ends: 54
[2018-09-30 10:34:37,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650
[2018-09-30 10:34:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-09-30 10:34:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53.
[2018-09-30 10:34:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-09-30 10:34:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions.
[2018-09-30 10:34:37,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48
[2018-09-30 10:34:37,464 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:37,464 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions.
[2018-09-30 10:34:37,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-09-30 10:34:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions.
[2018-09-30 10:34:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2018-09-30 10:34:37,465 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:37,465 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1]
[2018-09-30 10:34:37,465 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:37,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times
[2018-09-30 10:34:37,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:37,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:37,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:37,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:37,841 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:37,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:34:38,028 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s)
[2018-09-30 10:34:38,029 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:38,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:38,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:38,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:38,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:38,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:38,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26
[2018-09-30 10:34:38,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-09-30 10:34:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-09-30 10:34:38,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756
[2018-09-30 10:34:38,346 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states.
[2018-09-30 10:34:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:38,478 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions.
[2018-09-30 10:34:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-09-30 10:34:38,478 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52
[2018-09-30 10:34:38,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:38,479 INFO L225 Difference]: With dead ends: 59
[2018-09-30 10:34:38,479 INFO L226 Difference]: Without dead ends: 58
[2018-09-30 10:34:38,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756
[2018-09-30 10:34:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-09-30 10:34:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57.
[2018-09-30 10:34:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-09-30 10:34:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions.
[2018-09-30 10:34:38,486 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52
[2018-09-30 10:34:38,487 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:38,487 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions.
[2018-09-30 10:34:38,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-09-30 10:34:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions.
[2018-09-30 10:34:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-09-30 10:34:38,488 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:38,488 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1]
[2018-09-30 10:34:38,488 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:38,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:38,489 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times
[2018-09-30 10:34:38,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:38,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:38,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:38,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:38,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:38,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:38,716 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:38,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:38,745 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:38,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:38,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:38,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:38,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:39,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:39,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28
[2018-09-30 10:34:39,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-09-30 10:34:39,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-09-30 10:34:39,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870
[2018-09-30 10:34:39,132 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states.
[2018-09-30 10:34:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:39,367 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions.
[2018-09-30 10:34:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-09-30 10:34:39,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56
[2018-09-30 10:34:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:39,368 INFO L225 Difference]: With dead ends: 63
[2018-09-30 10:34:39,368 INFO L226 Difference]: Without dead ends: 62
[2018-09-30 10:34:39,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870
[2018-09-30 10:34:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2018-09-30 10:34:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61.
[2018-09-30 10:34:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-09-30 10:34:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions.
[2018-09-30 10:34:39,374 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56
[2018-09-30 10:34:39,375 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:39,375 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions.
[2018-09-30 10:34:39,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-09-30 10:34:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions.
[2018-09-30 10:34:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-09-30 10:34:39,376 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:39,376 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1]
[2018-09-30 10:34:39,376 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:39,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times
[2018-09-30 10:34:39,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:39,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:39,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:39,669 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:39,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:39,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:34:39,700 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:34:39,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:39,703 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:39,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:39,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:39,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:39,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:40,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:40,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30
[2018-09-30 10:34:40,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-09-30 10:34:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-09-30 10:34:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992
[2018-09-30 10:34:40,090 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states.
[2018-09-30 10:34:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:40,274 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions.
[2018-09-30 10:34:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-09-30 10:34:40,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60
[2018-09-30 10:34:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:40,276 INFO L225 Difference]: With dead ends: 67
[2018-09-30 10:34:40,276 INFO L226 Difference]: Without dead ends: 66
[2018-09-30 10:34:40,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992
[2018-09-30 10:34:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2018-09-30 10:34:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65.
[2018-09-30 10:34:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2018-09-30 10:34:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions.
[2018-09-30 10:34:40,283 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60
[2018-09-30 10:34:40,283 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:40,283 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions.
[2018-09-30 10:34:40,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-09-30 10:34:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions.
[2018-09-30 10:34:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2018-09-30 10:34:40,284 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:40,284 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1]
[2018-09-30 10:34:40,285 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:40,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times
[2018-09-30 10:34:40,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:40,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:40,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:40,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:40,571 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:40,571 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:34:40,619 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s)
[2018-09-30 10:34:40,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:40,623 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:40,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:40,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:40,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:40,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:41,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:41,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32
[2018-09-30 10:34:41,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-09-30 10:34:41,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-09-30 10:34:41,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122
[2018-09-30 10:34:41,051 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states.
[2018-09-30 10:34:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:41,328 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions.
[2018-09-30 10:34:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-09-30 10:34:41,328 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64
[2018-09-30 10:34:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:41,329 INFO L225 Difference]: With dead ends: 71
[2018-09-30 10:34:41,329 INFO L226 Difference]: Without dead ends: 70
[2018-09-30 10:34:41,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122
[2018-09-30 10:34:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2018-09-30 10:34:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69.
[2018-09-30 10:34:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2018-09-30 10:34:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions.
[2018-09-30 10:34:41,336 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64
[2018-09-30 10:34:41,336 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:41,336 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions.
[2018-09-30 10:34:41,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-09-30 10:34:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions.
[2018-09-30 10:34:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-09-30 10:34:41,337 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:41,338 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1]
[2018-09-30 10:34:41,338 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:41,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times
[2018-09-30 10:34:41,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:41,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:41,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:41,618 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:41,618 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:41,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:34:41,646 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:34:41,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:41,649 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:41,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:41,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:41,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:41,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:42,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:42,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34
[2018-09-30 10:34:42,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states
[2018-09-30 10:34:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2018-09-30 10:34:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260
[2018-09-30 10:34:42,196 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states.
[2018-09-30 10:34:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:42,306 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions.
[2018-09-30 10:34:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-09-30 10:34:42,307 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68
[2018-09-30 10:34:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:42,308 INFO L225 Difference]: With dead ends: 75
[2018-09-30 10:34:42,308 INFO L226 Difference]: Without dead ends: 74
[2018-09-30 10:34:42,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260
[2018-09-30 10:34:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2018-09-30 10:34:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73.
[2018-09-30 10:34:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states.
[2018-09-30 10:34:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions.
[2018-09-30 10:34:42,314 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68
[2018-09-30 10:34:42,315 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:42,315 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions.
[2018-09-30 10:34:42,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states.
[2018-09-30 10:34:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions.
[2018-09-30 10:34:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-09-30 10:34:42,316 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:42,316 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1]
[2018-09-30 10:34:42,316 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:42,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:42,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times
[2018-09-30 10:34:42,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:42,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:42,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:42,744 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:42,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:34:42,791 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s)
[2018-09-30 10:34:42,791 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:42,795 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:42,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:42,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:42,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:43,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:43,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36
[2018-09-30 10:34:43,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-09-30 10:34:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-09-30 10:34:43,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406
[2018-09-30 10:34:43,304 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states.
[2018-09-30 10:34:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:43,401 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions.
[2018-09-30 10:34:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-09-30 10:34:43,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72
[2018-09-30 10:34:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:43,402 INFO L225 Difference]: With dead ends: 79
[2018-09-30 10:34:43,402 INFO L226 Difference]: Without dead ends: 78
[2018-09-30 10:34:43,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406
[2018-09-30 10:34:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2018-09-30 10:34:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77.
[2018-09-30 10:34:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-09-30 10:34:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions.
[2018-09-30 10:34:43,408 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72
[2018-09-30 10:34:43,408 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:43,408 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions.
[2018-09-30 10:34:43,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-09-30 10:34:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions.
[2018-09-30 10:34:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-09-30 10:34:43,409 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:43,410 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1]
[2018-09-30 10:34:43,410 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:43,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times
[2018-09-30 10:34:43,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:43,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:43,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:43,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:43,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:43,847 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:34:43,888 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s)
[2018-09-30 10:34:43,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:43,892 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:43,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:43,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:43,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:43,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:44,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:44,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38
[2018-09-30 10:34:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states
[2018-09-30 10:34:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2018-09-30 10:34:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560
[2018-09-30 10:34:44,531 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states.
[2018-09-30 10:34:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:44,668 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions.
[2018-09-30 10:34:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-09-30 10:34:44,669 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76
[2018-09-30 10:34:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:44,670 INFO L225 Difference]: With dead ends: 83
[2018-09-30 10:34:44,670 INFO L226 Difference]: Without dead ends: 82
[2018-09-30 10:34:44,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560
[2018-09-30 10:34:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-09-30 10:34:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81.
[2018-09-30 10:34:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-09-30 10:34:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions.
[2018-09-30 10:34:44,675 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76
[2018-09-30 10:34:44,675 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:44,675 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions.
[2018-09-30 10:34:44,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2018-09-30 10:34:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions.
[2018-09-30 10:34:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-09-30 10:34:44,676 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:44,676 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1]
[2018-09-30 10:34:44,677 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:44,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times
[2018-09-30 10:34:44,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:44,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:44,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:45,471 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:45,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:45,506 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:45,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:45,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:45,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:45,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:46,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:46,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40
[2018-09-30 10:34:46,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-09-30 10:34:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-09-30 10:34:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722
[2018-09-30 10:34:46,372 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states.
[2018-09-30 10:34:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:46,527 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions.
[2018-09-30 10:34:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-09-30 10:34:46,528 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80
[2018-09-30 10:34:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:46,529 INFO L225 Difference]: With dead ends: 87
[2018-09-30 10:34:46,529 INFO L226 Difference]: Without dead ends: 86
[2018-09-30 10:34:46,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722
[2018-09-30 10:34:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-09-30 10:34:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85.
[2018-09-30 10:34:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-09-30 10:34:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions.
[2018-09-30 10:34:46,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80
[2018-09-30 10:34:46,535 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:46,536 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions.
[2018-09-30 10:34:46,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-09-30 10:34:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions.
[2018-09-30 10:34:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2018-09-30 10:34:46,537 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:46,537 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1]
[2018-09-30 10:34:46,537 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:46,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times
[2018-09-30 10:34:46,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:46,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:47,173 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:47,173 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:34:47,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:34:47,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:47,211 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:47,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:47,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:47,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:47,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:47,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:47,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42
[2018-09-30 10:34:47,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-09-30 10:34:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-09-30 10:34:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892
[2018-09-30 10:34:47,609 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states.
[2018-09-30 10:34:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:47,768 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions.
[2018-09-30 10:34:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-09-30 10:34:47,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84
[2018-09-30 10:34:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:47,769 INFO L225 Difference]: With dead ends: 91
[2018-09-30 10:34:47,769 INFO L226 Difference]: Without dead ends: 90
[2018-09-30 10:34:47,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892
[2018-09-30 10:34:47,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2018-09-30 10:34:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89.
[2018-09-30 10:34:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-09-30 10:34:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions.
[2018-09-30 10:34:47,774 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84
[2018-09-30 10:34:47,774 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:47,774 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions.
[2018-09-30 10:34:47,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-09-30 10:34:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions.
[2018-09-30 10:34:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2018-09-30 10:34:47,775 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:47,776 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1]
[2018-09-30 10:34:47,776 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:47,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times
[2018-09-30 10:34:47,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:47,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:47,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:47,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:48,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:48,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:48,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:34:48,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s)
[2018-09-30 10:34:48,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:48,813 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:48,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:48,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:48,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:48,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:50,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:50,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44
[2018-09-30 10:34:50,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-09-30 10:34:50,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-09-30 10:34:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070
[2018-09-30 10:34:50,415 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states.
[2018-09-30 10:34:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:50,570 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions.
[2018-09-30 10:34:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-09-30 10:34:50,571 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88
[2018-09-30 10:34:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:50,572 INFO L225 Difference]: With dead ends: 95
[2018-09-30 10:34:50,572 INFO L226 Difference]: Without dead ends: 94
[2018-09-30 10:34:50,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070
[2018-09-30 10:34:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2018-09-30 10:34:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93.
[2018-09-30 10:34:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-09-30 10:34:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions.
[2018-09-30 10:34:50,576 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88
[2018-09-30 10:34:50,576 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:50,576 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions.
[2018-09-30 10:34:50,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-09-30 10:34:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions.
[2018-09-30 10:34:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2018-09-30 10:34:50,577 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:50,577 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1]
[2018-09-30 10:34:50,577 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:50,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times
[2018-09-30 10:34:50,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:50,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:50,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:50,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:51,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:51,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:34:51,519 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:34:51,519 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:51,522 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:51,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:51,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:51,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:51,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:52,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:52,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46
[2018-09-30 10:34:52,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states
[2018-09-30 10:34:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2018-09-30 10:34:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256
[2018-09-30 10:34:52,066 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states.
[2018-09-30 10:34:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:52,213 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions.
[2018-09-30 10:34:52,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-09-30 10:34:52,214 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92
[2018-09-30 10:34:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:52,215 INFO L225 Difference]: With dead ends: 99
[2018-09-30 10:34:52,215 INFO L226 Difference]: Without dead ends: 98
[2018-09-30 10:34:52,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256
[2018-09-30 10:34:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2018-09-30 10:34:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97.
[2018-09-30 10:34:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-09-30 10:34:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions.
[2018-09-30 10:34:52,220 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92
[2018-09-30 10:34:52,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:52,221 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions.
[2018-09-30 10:34:52,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states.
[2018-09-30 10:34:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions.
[2018-09-30 10:34:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-09-30 10:34:52,222 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:52,222 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1]
[2018-09-30 10:34:52,222 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:52,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times
[2018-09-30 10:34:52,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:52,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:52,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:52,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:52,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:52,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:52,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:34:52,700 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s)
[2018-09-30 10:34:52,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:52,704 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:52,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:52,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:52,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:52,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:53,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:53,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48
[2018-09-30 10:34:53,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states
[2018-09-30 10:34:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2018-09-30 10:34:53,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450
[2018-09-30 10:34:53,240 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states.
[2018-09-30 10:34:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:53,497 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions.
[2018-09-30 10:34:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-09-30 10:34:53,498 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96
[2018-09-30 10:34:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:53,499 INFO L225 Difference]: With dead ends: 103
[2018-09-30 10:34:53,499 INFO L226 Difference]: Without dead ends: 102
[2018-09-30 10:34:53,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450
[2018-09-30 10:34:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2018-09-30 10:34:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101.
[2018-09-30 10:34:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states.
[2018-09-30 10:34:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions.
[2018-09-30 10:34:53,505 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96
[2018-09-30 10:34:53,505 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:53,505 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions.
[2018-09-30 10:34:53,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states.
[2018-09-30 10:34:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions.
[2018-09-30 10:34:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2018-09-30 10:34:53,506 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:53,506 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1]
[2018-09-30 10:34:53,507 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:53,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times
[2018-09-30 10:34:53,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:53,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:53,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:53,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:53,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:54,066 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:54,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:54,074 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:34:54,133 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s)
[2018-09-30 10:34:54,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:54,137 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:54,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:54,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:54,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:54,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:54,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:54,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50
[2018-09-30 10:34:54,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states
[2018-09-30 10:34:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants.
[2018-09-30 10:34:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652
[2018-09-30 10:34:54,631 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states.
[2018-09-30 10:34:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:54,825 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions.
[2018-09-30 10:34:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-09-30 10:34:54,825 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100
[2018-09-30 10:34:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:54,826 INFO L225 Difference]: With dead ends: 107
[2018-09-30 10:34:54,827 INFO L226 Difference]: Without dead ends: 106
[2018-09-30 10:34:54,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652
[2018-09-30 10:34:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2018-09-30 10:34:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105.
[2018-09-30 10:34:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2018-09-30 10:34:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions.
[2018-09-30 10:34:54,832 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100
[2018-09-30 10:34:54,833 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:54,833 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions.
[2018-09-30 10:34:54,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states.
[2018-09-30 10:34:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions.
[2018-09-30 10:34:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2018-09-30 10:34:54,834 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:54,834 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1]
[2018-09-30 10:34:54,834 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:54,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:54,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times
[2018-09-30 10:34:54,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:54,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:54,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:54,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:54,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:55,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:55,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:55,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:55,408 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:55,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:55,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:55,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:55,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:56,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:56,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52
[2018-09-30 10:34:56,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states
[2018-09-30 10:34:56,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2018-09-30 10:34:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862
[2018-09-30 10:34:56,172 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states.
[2018-09-30 10:34:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:56,403 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions.
[2018-09-30 10:34:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-09-30 10:34:56,403 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104
[2018-09-30 10:34:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:56,404 INFO L225 Difference]: With dead ends: 111
[2018-09-30 10:34:56,404 INFO L226 Difference]: Without dead ends: 110
[2018-09-30 10:34:56,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862
[2018-09-30 10:34:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2018-09-30 10:34:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109.
[2018-09-30 10:34:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states.
[2018-09-30 10:34:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions.
[2018-09-30 10:34:56,410 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104
[2018-09-30 10:34:56,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:56,410 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions.
[2018-09-30 10:34:56,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states.
[2018-09-30 10:34:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions.
[2018-09-30 10:34:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2018-09-30 10:34:56,411 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:56,411 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1]
[2018-09-30 10:34:56,411 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:56,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times
[2018-09-30 10:34:56,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:56,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:56,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:56,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:34:56,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:57,001 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:57,001 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:57,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:34:57,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:34:57,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:57,039 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:57,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:57,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:57,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:57,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:57,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:57,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54
[2018-09-30 10:34:57,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states
[2018-09-30 10:34:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2018-09-30 10:34:57,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080
[2018-09-30 10:34:57,608 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states.
[2018-09-30 10:34:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:57,797 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions.
[2018-09-30 10:34:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-09-30 10:34:57,797 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108
[2018-09-30 10:34:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:57,798 INFO L225 Difference]: With dead ends: 115
[2018-09-30 10:34:57,799 INFO L226 Difference]: Without dead ends: 114
[2018-09-30 10:34:57,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080
[2018-09-30 10:34:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-09-30 10:34:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113.
[2018-09-30 10:34:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-09-30 10:34:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions.
[2018-09-30 10:34:57,804 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108
[2018-09-30 10:34:57,805 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:57,805 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions.
[2018-09-30 10:34:57,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states.
[2018-09-30 10:34:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions.
[2018-09-30 10:34:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2018-09-30 10:34:57,806 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:57,806 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1]
[2018-09-30 10:34:57,806 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:57,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times
[2018-09-30 10:34:57,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:57,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:57,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:57,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:57,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:58,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:58,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:34:58,517 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s)
[2018-09-30 10:34:58,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:58,521 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:58,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:58,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:58,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:34:58,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:34:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:59,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:34:59,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56
[2018-09-30 10:34:59,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states
[2018-09-30 10:34:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2018-09-30 10:34:59,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306
[2018-09-30 10:34:59,113 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states.
[2018-09-30 10:34:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:34:59,306 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions.
[2018-09-30 10:34:59,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-09-30 10:34:59,307 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112
[2018-09-30 10:34:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:34:59,308 INFO L225 Difference]: With dead ends: 119
[2018-09-30 10:34:59,308 INFO L226 Difference]: Without dead ends: 118
[2018-09-30 10:34:59,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306
[2018-09-30 10:34:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2018-09-30 10:34:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117.
[2018-09-30 10:34:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2018-09-30 10:34:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions.
[2018-09-30 10:34:59,314 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112
[2018-09-30 10:34:59,314 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:34:59,314 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions.
[2018-09-30 10:34:59,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states.
[2018-09-30 10:34:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions.
[2018-09-30 10:34:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2018-09-30 10:34:59,315 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:34:59,315 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1]
[2018-09-30 10:34:59,315 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:34:59,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:34:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times
[2018-09-30 10:34:59,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:34:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:34:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:59,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:34:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:34:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:34:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:34:59,877 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:34:59,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:34:59,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:34:59,915 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:34:59,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:34:59,919 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:34:59,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:34:59,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:00,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:00,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:00,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:00,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58
[2018-09-30 10:35:00,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states
[2018-09-30 10:35:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2018-09-30 10:35:00,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540
[2018-09-30 10:35:00,655 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states.
[2018-09-30 10:35:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:00,819 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions.
[2018-09-30 10:35:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-09-30 10:35:00,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116
[2018-09-30 10:35:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:00,821 INFO L225 Difference]: With dead ends: 123
[2018-09-30 10:35:00,821 INFO L226 Difference]: Without dead ends: 122
[2018-09-30 10:35:00,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540
[2018-09-30 10:35:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2018-09-30 10:35:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121.
[2018-09-30 10:35:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2018-09-30 10:35:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions.
[2018-09-30 10:35:00,827 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116
[2018-09-30 10:35:00,827 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:00,827 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions.
[2018-09-30 10:35:00,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states.
[2018-09-30 10:35:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions.
[2018-09-30 10:35:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2018-09-30 10:35:00,828 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:00,828 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1]
[2018-09-30 10:35:00,829 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:00,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times
[2018-09-30 10:35:00,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:00,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:01,558 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:01,558 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:35:01,634 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s)
[2018-09-30 10:35:01,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:01,639 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:01,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:01,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:01,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:01,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:02,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:02,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60
[2018-09-30 10:35:02,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states
[2018-09-30 10:35:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants.
[2018-09-30 10:35:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782
[2018-09-30 10:35:02,345 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states.
[2018-09-30 10:35:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:02,588 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions.
[2018-09-30 10:35:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-09-30 10:35:02,589 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120
[2018-09-30 10:35:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:02,590 INFO L225 Difference]: With dead ends: 127
[2018-09-30 10:35:02,591 INFO L226 Difference]: Without dead ends: 126
[2018-09-30 10:35:02,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782
[2018-09-30 10:35:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2018-09-30 10:35:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125.
[2018-09-30 10:35:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states.
[2018-09-30 10:35:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions.
[2018-09-30 10:35:02,596 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120
[2018-09-30 10:35:02,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:02,596 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions.
[2018-09-30 10:35:02,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states.
[2018-09-30 10:35:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions.
[2018-09-30 10:35:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2018-09-30 10:35:02,597 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:02,597 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1]
[2018-09-30 10:35:02,598 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:02,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times
[2018-09-30 10:35:02,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:02,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:03,810 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:03,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:03,818 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:35:03,900 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s)
[2018-09-30 10:35:03,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:03,904 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:03,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:03,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:03,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:03,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:04,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:04,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62
[2018-09-30 10:35:04,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states
[2018-09-30 10:35:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants.
[2018-09-30 10:35:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032
[2018-09-30 10:35:04,602 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states.
[2018-09-30 10:35:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:04,797 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions.
[2018-09-30 10:35:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-09-30 10:35:04,797 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124
[2018-09-30 10:35:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:04,798 INFO L225 Difference]: With dead ends: 131
[2018-09-30 10:35:04,798 INFO L226 Difference]: Without dead ends: 130
[2018-09-30 10:35:04,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032
[2018-09-30 10:35:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2018-09-30 10:35:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129.
[2018-09-30 10:35:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-09-30 10:35:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions.
[2018-09-30 10:35:04,803 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124
[2018-09-30 10:35:04,803 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:04,803 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions.
[2018-09-30 10:35:04,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states.
[2018-09-30 10:35:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions.
[2018-09-30 10:35:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2018-09-30 10:35:04,804 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:04,804 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1]
[2018-09-30 10:35:04,805 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:04,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times
[2018-09-30 10:35:04,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:04,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:05,530 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:05,530 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:05,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:35:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:05,576 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:05,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:05,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:05,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:05,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:06,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:06,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64
[2018-09-30 10:35:06,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states
[2018-09-30 10:35:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants.
[2018-09-30 10:35:06,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290
[2018-09-30 10:35:06,673 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states.
[2018-09-30 10:35:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:06,888 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions.
[2018-09-30 10:35:06,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-09-30 10:35:06,888 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128
[2018-09-30 10:35:06,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:06,889 INFO L225 Difference]: With dead ends: 135
[2018-09-30 10:35:06,890 INFO L226 Difference]: Without dead ends: 134
[2018-09-30 10:35:06,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290
[2018-09-30 10:35:06,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2018-09-30 10:35:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133.
[2018-09-30 10:35:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states.
[2018-09-30 10:35:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions.
[2018-09-30 10:35:06,895 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128
[2018-09-30 10:35:06,896 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:06,896 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions.
[2018-09-30 10:35:06,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states.
[2018-09-30 10:35:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions.
[2018-09-30 10:35:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2018-09-30 10:35:06,897 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:06,897 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1]
[2018-09-30 10:35:06,897 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:06,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times
[2018-09-30 10:35:06,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:06,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:06,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:06,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:35:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:07,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:07,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:07,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:35:07,737 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:35:07,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:07,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:07,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:07,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:07,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:08,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:08,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66
[2018-09-30 10:35:08,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states
[2018-09-30 10:35:08,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants.
[2018-09-30 10:35:08,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556
[2018-09-30 10:35:08,562 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states.
[2018-09-30 10:35:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:08,781 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions.
[2018-09-30 10:35:08,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-09-30 10:35:08,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132
[2018-09-30 10:35:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:08,783 INFO L225 Difference]: With dead ends: 139
[2018-09-30 10:35:08,784 INFO L226 Difference]: Without dead ends: 138
[2018-09-30 10:35:08,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556
[2018-09-30 10:35:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2018-09-30 10:35:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137.
[2018-09-30 10:35:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states.
[2018-09-30 10:35:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions.
[2018-09-30 10:35:08,790 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132
[2018-09-30 10:35:08,791 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:08,791 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions.
[2018-09-30 10:35:08,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states.
[2018-09-30 10:35:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions.
[2018-09-30 10:35:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2018-09-30 10:35:08,792 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:08,792 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1]
[2018-09-30 10:35:08,792 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:08,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:08,792 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times
[2018-09-30 10:35:08,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:08,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:08,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:08,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:08,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:09,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:09,494 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:09,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:35:09,672 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s)
[2018-09-30 10:35:09,672 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:09,676 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:09,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:09,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:09,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:09,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:11,647 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:11,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68
[2018-09-30 10:35:11,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states
[2018-09-30 10:35:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants.
[2018-09-30 10:35:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830
[2018-09-30 10:35:11,649 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states.
[2018-09-30 10:35:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:12,033 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions.
[2018-09-30 10:35:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-09-30 10:35:12,033 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136
[2018-09-30 10:35:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:12,035 INFO L225 Difference]: With dead ends: 143
[2018-09-30 10:35:12,035 INFO L226 Difference]: Without dead ends: 142
[2018-09-30 10:35:12,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830
[2018-09-30 10:35:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states.
[2018-09-30 10:35:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141.
[2018-09-30 10:35:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states.
[2018-09-30 10:35:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions.
[2018-09-30 10:35:12,039 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136
[2018-09-30 10:35:12,040 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:12,040 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions.
[2018-09-30 10:35:12,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states.
[2018-09-30 10:35:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions.
[2018-09-30 10:35:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2018-09-30 10:35:12,041 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:12,041 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1]
[2018-09-30 10:35:12,041 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:12,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times
[2018-09-30 10:35:12,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:12,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:12,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:12,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:12,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:12,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:35:12,842 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:35:12,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:12,846 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:12,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:12,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:12,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:12,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:13,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:13,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70
[2018-09-30 10:35:13,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states
[2018-09-30 10:35:13,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants.
[2018-09-30 10:35:13,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112
[2018-09-30 10:35:13,843 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states.
[2018-09-30 10:35:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:14,220 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions.
[2018-09-30 10:35:14,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-09-30 10:35:14,221 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140
[2018-09-30 10:35:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:14,222 INFO L225 Difference]: With dead ends: 147
[2018-09-30 10:35:14,222 INFO L226 Difference]: Without dead ends: 146
[2018-09-30 10:35:14,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112
[2018-09-30 10:35:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2018-09-30 10:35:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145.
[2018-09-30 10:35:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states.
[2018-09-30 10:35:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions.
[2018-09-30 10:35:14,228 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140
[2018-09-30 10:35:14,229 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:14,229 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions.
[2018-09-30 10:35:14,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states.
[2018-09-30 10:35:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions.
[2018-09-30 10:35:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2018-09-30 10:35:14,230 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:14,230 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1]
[2018-09-30 10:35:14,230 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:14,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times
[2018-09-30 10:35:14,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:14,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:14,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:15,222 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:15,222 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:15,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:35:15,331 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s)
[2018-09-30 10:35:15,331 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:15,335 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:15,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:15,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:15,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:15,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:16,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:16,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72
[2018-09-30 10:35:16,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states
[2018-09-30 10:35:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants.
[2018-09-30 10:35:16,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402
[2018-09-30 10:35:16,200 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states.
[2018-09-30 10:35:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:16,656 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions.
[2018-09-30 10:35:16,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2018-09-30 10:35:16,657 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144
[2018-09-30 10:35:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:16,658 INFO L225 Difference]: With dead ends: 151
[2018-09-30 10:35:16,658 INFO L226 Difference]: Without dead ends: 150
[2018-09-30 10:35:16,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402
[2018-09-30 10:35:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-09-30 10:35:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149.
[2018-09-30 10:35:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states.
[2018-09-30 10:35:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions.
[2018-09-30 10:35:16,663 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144
[2018-09-30 10:35:16,663 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:16,663 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions.
[2018-09-30 10:35:16,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states.
[2018-09-30 10:35:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions.
[2018-09-30 10:35:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149
[2018-09-30 10:35:16,664 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:16,664 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1]
[2018-09-30 10:35:16,665 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:16,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times
[2018-09-30 10:35:16,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:16,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:16,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:17,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:17,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:35:17,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s)
[2018-09-30 10:35:17,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:17,714 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:17,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:17,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:17,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:17,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:18,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:18,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74
[2018-09-30 10:35:18,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states
[2018-09-30 10:35:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants.
[2018-09-30 10:35:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700
[2018-09-30 10:35:18,702 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states.
[2018-09-30 10:35:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:18,978 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions.
[2018-09-30 10:35:18,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states.
[2018-09-30 10:35:18,979 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148
[2018-09-30 10:35:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:18,980 INFO L225 Difference]: With dead ends: 155
[2018-09-30 10:35:18,980 INFO L226 Difference]: Without dead ends: 154
[2018-09-30 10:35:18,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700
[2018-09-30 10:35:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2018-09-30 10:35:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153.
[2018-09-30 10:35:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states.
[2018-09-30 10:35:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions.
[2018-09-30 10:35:18,987 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148
[2018-09-30 10:35:18,987 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:18,987 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions.
[2018-09-30 10:35:18,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states.
[2018-09-30 10:35:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions.
[2018-09-30 10:35:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2018-09-30 10:35:18,988 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:18,988 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1]
[2018-09-30 10:35:18,989 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:18,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times
[2018-09-30 10:35:18,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:18,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:18,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:19,843 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:19,843 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:19,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:35:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:19,892 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:19,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:19,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:19,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:19,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:21,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:21,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76
[2018-09-30 10:35:21,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states
[2018-09-30 10:35:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants.
[2018-09-30 10:35:21,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006
[2018-09-30 10:35:21,002 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states.
[2018-09-30 10:35:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:21,263 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions.
[2018-09-30 10:35:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2018-09-30 10:35:21,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152
[2018-09-30 10:35:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:21,265 INFO L225 Difference]: With dead ends: 159
[2018-09-30 10:35:21,265 INFO L226 Difference]: Without dead ends: 158
[2018-09-30 10:35:21,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006
[2018-09-30 10:35:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-09-30 10:35:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157.
[2018-09-30 10:35:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states.
[2018-09-30 10:35:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions.
[2018-09-30 10:35:21,270 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152
[2018-09-30 10:35:21,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:21,270 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions.
[2018-09-30 10:35:21,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states.
[2018-09-30 10:35:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions.
[2018-09-30 10:35:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2018-09-30 10:35:21,271 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:21,271 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1]
[2018-09-30 10:35:21,272 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:21,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times
[2018-09-30 10:35:21,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:21,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:21,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:35:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:22,448 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:22,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:22,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:35:22,497 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:35:22,497 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:22,501 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:22,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:22,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:22,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:22,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:23,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:23,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78
[2018-09-30 10:35:23,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states
[2018-09-30 10:35:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants.
[2018-09-30 10:35:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320
[2018-09-30 10:35:23,553 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states.
[2018-09-30 10:35:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:23,826 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions.
[2018-09-30 10:35:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-09-30 10:35:23,826 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156
[2018-09-30 10:35:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:23,828 INFO L225 Difference]: With dead ends: 163
[2018-09-30 10:35:23,828 INFO L226 Difference]: Without dead ends: 162
[2018-09-30 10:35:23,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320
[2018-09-30 10:35:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2018-09-30 10:35:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161.
[2018-09-30 10:35:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2018-09-30 10:35:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions.
[2018-09-30 10:35:23,834 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156
[2018-09-30 10:35:23,834 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:23,834 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions.
[2018-09-30 10:35:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states.
[2018-09-30 10:35:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions.
[2018-09-30 10:35:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2018-09-30 10:35:23,835 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:23,836 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1]
[2018-09-30 10:35:23,836 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:23,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times
[2018-09-30 10:35:23,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:23,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:23,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:26,594 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:26,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:26,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:35:27,159 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s)
[2018-09-30 10:35:27,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:27,163 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:27,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:27,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:27,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:27,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:28,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:28,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80
[2018-09-30 10:35:28,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states
[2018-09-30 10:35:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants.
[2018-09-30 10:35:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642
[2018-09-30 10:35:28,271 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states.
[2018-09-30 10:35:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:28,535 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions.
[2018-09-30 10:35:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2018-09-30 10:35:28,535 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160
[2018-09-30 10:35:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:28,537 INFO L225 Difference]: With dead ends: 167
[2018-09-30 10:35:28,537 INFO L226 Difference]: Without dead ends: 166
[2018-09-30 10:35:28,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642
[2018-09-30 10:35:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states.
[2018-09-30 10:35:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165.
[2018-09-30 10:35:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states.
[2018-09-30 10:35:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions.
[2018-09-30 10:35:28,543 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160
[2018-09-30 10:35:28,543 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:28,543 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions.
[2018-09-30 10:35:28,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states.
[2018-09-30 10:35:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions.
[2018-09-30 10:35:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2018-09-30 10:35:28,543 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:28,544 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1]
[2018-09-30 10:35:28,544 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:28,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times
[2018-09-30 10:35:28,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:28,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:28,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:29,490 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:29,490 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:29,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:35:29,542 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:35:29,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:29,546 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:29,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:29,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:29,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:29,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:30,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:30,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82
[2018-09-30 10:35:30,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states
[2018-09-30 10:35:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants.
[2018-09-30 10:35:30,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972
[2018-09-30 10:35:30,721 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states.
[2018-09-30 10:35:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:31,245 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions.
[2018-09-30 10:35:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2018-09-30 10:35:31,245 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164
[2018-09-30 10:35:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:31,246 INFO L225 Difference]: With dead ends: 171
[2018-09-30 10:35:31,246 INFO L226 Difference]: Without dead ends: 170
[2018-09-30 10:35:31,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972
[2018-09-30 10:35:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2018-09-30 10:35:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169.
[2018-09-30 10:35:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states.
[2018-09-30 10:35:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions.
[2018-09-30 10:35:31,254 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164
[2018-09-30 10:35:31,254 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:31,254 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions.
[2018-09-30 10:35:31,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states.
[2018-09-30 10:35:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions.
[2018-09-30 10:35:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2018-09-30 10:35:31,256 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:31,256 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1]
[2018-09-30 10:35:31,256 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:31,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times
[2018-09-30 10:35:31,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:31,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:31,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:33,095 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:33,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:33,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:35:33,268 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s)
[2018-09-30 10:35:33,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:33,273 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:33,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:33,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:33,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:33,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:34,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-09-30 10:35:34,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:34,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84
[2018-09-30 10:35:34,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states
[2018-09-30 10:35:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants.
[2018-09-30 10:35:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310
[2018-09-30 10:35:34,472 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states.
[2018-09-30 10:35:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:34,786 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions.
[2018-09-30 10:35:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-09-30 10:35:34,787 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168
[2018-09-30 10:35:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:34,788 INFO L225 Difference]: With dead ends: 175
[2018-09-30 10:35:34,789 INFO L226 Difference]: Without dead ends: 174
[2018-09-30 10:35:34,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310
[2018-09-30 10:35:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2018-09-30 10:35:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173.
[2018-09-30 10:35:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states.
[2018-09-30 10:35:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions.
[2018-09-30 10:35:34,795 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168
[2018-09-30 10:35:34,795 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:34,795 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions.
[2018-09-30 10:35:34,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states.
[2018-09-30 10:35:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions.
[2018-09-30 10:35:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2018-09-30 10:35:34,796 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:34,797 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1]
[2018-09-30 10:35:34,797 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:34,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times
[2018-09-30 10:35:34,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:34,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:36,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:36,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
[2018-09-30 10:35:36,876 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:37,060 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s)
[2018-09-30 10:35:37,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:37,065 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:37,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:37,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:37,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:37,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:38,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:38,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86
[2018-09-30 10:35:38,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states
[2018-09-30 10:35:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants.
[2018-09-30 10:35:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656
[2018-09-30 10:35:38,610 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states.
[2018-09-30 10:35:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:39,213 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions.
[2018-09-30 10:35:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-09-30 10:35:39,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172
[2018-09-30 10:35:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:39,215 INFO L225 Difference]: With dead ends: 179
[2018-09-30 10:35:39,215 INFO L226 Difference]: Without dead ends: 178
[2018-09-30 10:35:39,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656
[2018-09-30 10:35:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2018-09-30 10:35:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177.
[2018-09-30 10:35:39,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2018-09-30 10:35:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions.
[2018-09-30 10:35:39,221 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172
[2018-09-30 10:35:39,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:39,221 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions.
[2018-09-30 10:35:39,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states.
[2018-09-30 10:35:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions.
[2018-09-30 10:35:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2018-09-30 10:35:39,222 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:39,222 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1]
[2018-09-30 10:35:39,222 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:39,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times
[2018-09-30 10:35:39,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:39,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:39,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:39,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:39,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:40,432 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:40,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:40,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:35:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:40,491 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:40,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:40,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:40,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:40,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:41,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:41,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88
[2018-09-30 10:35:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states
[2018-09-30 10:35:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants.
[2018-09-30 10:35:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010
[2018-09-30 10:35:41,768 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states.
[2018-09-30 10:35:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:42,039 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions.
[2018-09-30 10:35:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2018-09-30 10:35:42,040 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176
[2018-09-30 10:35:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:42,041 INFO L225 Difference]: With dead ends: 183
[2018-09-30 10:35:42,041 INFO L226 Difference]: Without dead ends: 182
[2018-09-30 10:35:42,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010
[2018-09-30 10:35:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states.
[2018-09-30 10:35:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181.
[2018-09-30 10:35:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states.
[2018-09-30 10:35:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions.
[2018-09-30 10:35:42,046 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176
[2018-09-30 10:35:42,046 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:42,046 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions.
[2018-09-30 10:35:42,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states.
[2018-09-30 10:35:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions.
[2018-09-30 10:35:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2018-09-30 10:35:42,047 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:42,047 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1]
[2018-09-30 10:35:42,047 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:42,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times
[2018-09-30 10:35:42,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:42,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:42,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:42,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:35:42,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:43,380 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:43,380 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:35:43,434 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:35:43,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:43,439 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:43,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:43,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:43,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:43,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:44,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:44,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90
[2018-09-30 10:35:44,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states
[2018-09-30 10:35:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants.
[2018-09-30 10:35:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372
[2018-09-30 10:35:44,837 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states.
[2018-09-30 10:35:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:45,135 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions.
[2018-09-30 10:35:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-09-30 10:35:45,136 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180
[2018-09-30 10:35:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:45,137 INFO L225 Difference]: With dead ends: 187
[2018-09-30 10:35:45,137 INFO L226 Difference]: Without dead ends: 186
[2018-09-30 10:35:45,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372
[2018-09-30 10:35:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2018-09-30 10:35:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185.
[2018-09-30 10:35:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states.
[2018-09-30 10:35:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions.
[2018-09-30 10:35:45,144 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180
[2018-09-30 10:35:45,144 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:45,144 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions.
[2018-09-30 10:35:45,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states.
[2018-09-30 10:35:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions.
[2018-09-30 10:35:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2018-09-30 10:35:45,145 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:45,145 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1]
[2018-09-30 10:35:45,146 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:45,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times
[2018-09-30 10:35:45,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:45,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:45,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:45,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:45,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:46,337 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:46,337 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:46,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:35:46,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s)
[2018-09-30 10:35:46,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:46,508 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:46,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:46,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:46,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:46,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:48,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:48,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92
[2018-09-30 10:35:48,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states
[2018-09-30 10:35:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants.
[2018-09-30 10:35:48,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742
[2018-09-30 10:35:48,151 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states.
[2018-09-30 10:35:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:48,440 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions.
[2018-09-30 10:35:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2018-09-30 10:35:48,441 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184
[2018-09-30 10:35:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:48,442 INFO L225 Difference]: With dead ends: 191
[2018-09-30 10:35:48,443 INFO L226 Difference]: Without dead ends: 190
[2018-09-30 10:35:48,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742
[2018-09-30 10:35:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2018-09-30 10:35:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189.
[2018-09-30 10:35:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states.
[2018-09-30 10:35:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions.
[2018-09-30 10:35:48,448 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184
[2018-09-30 10:35:48,449 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:48,449 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions.
[2018-09-30 10:35:48,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states.
[2018-09-30 10:35:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions.
[2018-09-30 10:35:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189
[2018-09-30 10:35:48,449 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:48,450 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1]
[2018-09-30 10:35:48,450 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:48,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times
[2018-09-30 10:35:48,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:48,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:48,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:48,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:48,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:49,836 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:49,836 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:49,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:35:49,897 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:35:49,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:49,902 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:49,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:49,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:50,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:50,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:52,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:52,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94
[2018-09-30 10:35:52,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states
[2018-09-30 10:35:52,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants.
[2018-09-30 10:35:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120
[2018-09-30 10:35:52,978 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states.
[2018-09-30 10:35:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:53,440 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions.
[2018-09-30 10:35:53,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2018-09-30 10:35:53,440 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188
[2018-09-30 10:35:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:53,442 INFO L225 Difference]: With dead ends: 195
[2018-09-30 10:35:53,442 INFO L226 Difference]: Without dead ends: 194
[2018-09-30 10:35:53,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120
[2018-09-30 10:35:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2018-09-30 10:35:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193.
[2018-09-30 10:35:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states.
[2018-09-30 10:35:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions.
[2018-09-30 10:35:53,447 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188
[2018-09-30 10:35:53,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:53,447 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions.
[2018-09-30 10:35:53,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states.
[2018-09-30 10:35:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions.
[2018-09-30 10:35:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2018-09-30 10:35:53,448 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:53,448 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1]
[2018-09-30 10:35:53,449 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:53,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times
[2018-09-30 10:35:53,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:53,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:53,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:54,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:54,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:35:54,845 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s)
[2018-09-30 10:35:54,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:54,851 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:54,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:54,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:54,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:54,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:35:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:56,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:35:56,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96
[2018-09-30 10:35:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states
[2018-09-30 10:35:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants.
[2018-09-30 10:35:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506
[2018-09-30 10:35:56,596 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states.
[2018-09-30 10:35:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:35:56,948 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions.
[2018-09-30 10:35:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2018-09-30 10:35:56,949 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192
[2018-09-30 10:35:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:35:56,950 INFO L225 Difference]: With dead ends: 199
[2018-09-30 10:35:56,950 INFO L226 Difference]: Without dead ends: 198
[2018-09-30 10:35:56,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506
[2018-09-30 10:35:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2018-09-30 10:35:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197.
[2018-09-30 10:35:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states.
[2018-09-30 10:35:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions.
[2018-09-30 10:35:56,956 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192
[2018-09-30 10:35:56,957 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:35:56,957 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions.
[2018-09-30 10:35:56,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states.
[2018-09-30 10:35:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions.
[2018-09-30 10:35:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2018-09-30 10:35:56,957 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:35:56,958 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1]
[2018-09-30 10:35:56,958 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:35:56,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:35:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times
[2018-09-30 10:35:56,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:35:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:35:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:56,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:35:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:35:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:35:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:35:58,613 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:35:58,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:35:58,620 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:35:58,778 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s)
[2018-09-30 10:35:58,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:35:58,784 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:35:58,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:35:58,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:58,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:35:58,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:00,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:00,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98
[2018-09-30 10:36:00,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states
[2018-09-30 10:36:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants.
[2018-09-30 10:36:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900
[2018-09-30 10:36:00,295 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states.
[2018-09-30 10:36:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:00,654 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions.
[2018-09-30 10:36:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2018-09-30 10:36:00,655 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196
[2018-09-30 10:36:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:00,656 INFO L225 Difference]: With dead ends: 203
[2018-09-30 10:36:00,656 INFO L226 Difference]: Without dead ends: 202
[2018-09-30 10:36:00,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900
[2018-09-30 10:36:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2018-09-30 10:36:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201.
[2018-09-30 10:36:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states.
[2018-09-30 10:36:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions.
[2018-09-30 10:36:00,662 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196
[2018-09-30 10:36:00,662 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:00,662 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions.
[2018-09-30 10:36:00,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states.
[2018-09-30 10:36:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions.
[2018-09-30 10:36:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2018-09-30 10:36:00,663 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:00,664 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1]
[2018-09-30 10:36:00,664 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:00,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times
[2018-09-30 10:36:00,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:00,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:01,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:01,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:01,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:36:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:02,001 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:02,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:02,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:02,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:02,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:03,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:03,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100
[2018-09-30 10:36:03,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states
[2018-09-30 10:36:03,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants.
[2018-09-30 10:36:03,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302
[2018-09-30 10:36:03,864 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states.
[2018-09-30 10:36:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:04,175 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions.
[2018-09-30 10:36:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2018-09-30 10:36:04,175 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200
[2018-09-30 10:36:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:04,177 INFO L225 Difference]: With dead ends: 207
[2018-09-30 10:36:04,177 INFO L226 Difference]: Without dead ends: 206
[2018-09-30 10:36:04,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302
[2018-09-30 10:36:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2018-09-30 10:36:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205.
[2018-09-30 10:36:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states.
[2018-09-30 10:36:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions.
[2018-09-30 10:36:04,182 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200
[2018-09-30 10:36:04,183 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:04,183 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions.
[2018-09-30 10:36:04,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states.
[2018-09-30 10:36:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions.
[2018-09-30 10:36:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2018-09-30 10:36:04,184 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:04,184 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1]
[2018-09-30 10:36:04,184 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:04,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times
[2018-09-30 10:36:04,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:04,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:04,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:04,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:36:04,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:05,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:05,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:05,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:36:05,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:36:05,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:05,730 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:05,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:05,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:05,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:05,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:07,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:07,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102
[2018-09-30 10:36:07,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states
[2018-09-30 10:36:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants.
[2018-09-30 10:36:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712
[2018-09-30 10:36:07,786 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states.
[2018-09-30 10:36:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:08,175 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions.
[2018-09-30 10:36:08,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states.
[2018-09-30 10:36:08,175 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204
[2018-09-30 10:36:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:08,177 INFO L225 Difference]: With dead ends: 211
[2018-09-30 10:36:08,177 INFO L226 Difference]: Without dead ends: 210
[2018-09-30 10:36:08,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712
[2018-09-30 10:36:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2018-09-30 10:36:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209.
[2018-09-30 10:36:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states.
[2018-09-30 10:36:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions.
[2018-09-30 10:36:08,183 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204
[2018-09-30 10:36:08,183 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:08,184 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions.
[2018-09-30 10:36:08,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states.
[2018-09-30 10:36:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions.
[2018-09-30 10:36:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2018-09-30 10:36:08,185 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:08,185 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1]
[2018-09-30 10:36:08,185 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:08,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times
[2018-09-30 10:36:08,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:08,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:08,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:08,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:09,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:09,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:36:10,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s)
[2018-09-30 10:36:10,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:10,158 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:10,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:10,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:10,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:10,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:11,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:11,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104
[2018-09-30 10:36:11,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states
[2018-09-30 10:36:11,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants.
[2018-09-30 10:36:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130
[2018-09-30 10:36:11,908 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states.
[2018-09-30 10:36:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:12,246 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions.
[2018-09-30 10:36:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2018-09-30 10:36:12,247 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208
[2018-09-30 10:36:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:12,249 INFO L225 Difference]: With dead ends: 215
[2018-09-30 10:36:12,249 INFO L226 Difference]: Without dead ends: 214
[2018-09-30 10:36:12,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130
[2018-09-30 10:36:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2018-09-30 10:36:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213.
[2018-09-30 10:36:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states.
[2018-09-30 10:36:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions.
[2018-09-30 10:36:12,255 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208
[2018-09-30 10:36:12,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:12,256 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions.
[2018-09-30 10:36:12,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states.
[2018-09-30 10:36:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions.
[2018-09-30 10:36:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2018-09-30 10:36:12,257 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:12,257 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1]
[2018-09-30 10:36:12,257 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:12,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times
[2018-09-30 10:36:12,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:12,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:12,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:12,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:12,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:13,990 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:13,990 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:13,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:36:14,053 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:36:14,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:14,059 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:14,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:14,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:14,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:14,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:15,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:15,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106
[2018-09-30 10:36:15,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states
[2018-09-30 10:36:15,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants.
[2018-09-30 10:36:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556
[2018-09-30 10:36:15,817 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states.
[2018-09-30 10:36:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:16,147 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions.
[2018-09-30 10:36:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2018-09-30 10:36:16,148 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212
[2018-09-30 10:36:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:16,149 INFO L225 Difference]: With dead ends: 219
[2018-09-30 10:36:16,149 INFO L226 Difference]: Without dead ends: 218
[2018-09-30 10:36:16,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556
[2018-09-30 10:36:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2018-09-30 10:36:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217.
[2018-09-30 10:36:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states.
[2018-09-30 10:36:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions.
[2018-09-30 10:36:16,155 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212
[2018-09-30 10:36:16,155 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:16,155 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions.
[2018-09-30 10:36:16,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states.
[2018-09-30 10:36:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions.
[2018-09-30 10:36:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2018-09-30 10:36:16,156 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:16,156 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1]
[2018-09-30 10:36:16,156 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:16,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times
[2018-09-30 10:36:16,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:16,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:16,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:17,643 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36: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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:17,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:36:17,806 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s)
[2018-09-30 10:36:17,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:17,811 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:17,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:17,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:17,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:17,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:19,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:19,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108
[2018-09-30 10:36:19,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states
[2018-09-30 10:36:19,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants.
[2018-09-30 10:36:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990
[2018-09-30 10:36:19,884 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states.
[2018-09-30 10:36:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:20,235 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions.
[2018-09-30 10:36:20,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states.
[2018-09-30 10:36:20,236 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216
[2018-09-30 10:36:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:20,237 INFO L225 Difference]: With dead ends: 223
[2018-09-30 10:36:20,237 INFO L226 Difference]: Without dead ends: 222
[2018-09-30 10:36:20,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990
[2018-09-30 10:36:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2018-09-30 10:36:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221.
[2018-09-30 10:36:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states.
[2018-09-30 10:36:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions.
[2018-09-30 10:36:20,242 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216
[2018-09-30 10:36:20,243 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:20,243 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions.
[2018-09-30 10:36:20,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states.
[2018-09-30 10:36:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions.
[2018-09-30 10:36:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221
[2018-09-30 10:36:20,244 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:20,244 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1]
[2018-09-30 10:36:20,244 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:20,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times
[2018-09-30 10:36:20,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:20,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:20,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:20,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:20,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:21,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:21,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:21,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:36:22,045 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s)
[2018-09-30 10:36:22,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:22,052 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:22,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:22,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:22,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:22,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:24,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:24,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110
[2018-09-30 10:36:24,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states
[2018-09-30 10:36:24,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants.
[2018-09-30 10:36:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432
[2018-09-30 10:36:24,198 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states.
[2018-09-30 10:36:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:24,533 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions.
[2018-09-30 10:36:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states.
[2018-09-30 10:36:24,534 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220
[2018-09-30 10:36:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:24,535 INFO L225 Difference]: With dead ends: 227
[2018-09-30 10:36:24,535 INFO L226 Difference]: Without dead ends: 226
[2018-09-30 10:36:24,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432
[2018-09-30 10:36:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2018-09-30 10:36:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225.
[2018-09-30 10:36:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states.
[2018-09-30 10:36:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions.
[2018-09-30 10:36:24,542 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220
[2018-09-30 10:36:24,542 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:24,543 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions.
[2018-09-30 10:36:24,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states.
[2018-09-30 10:36:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions.
[2018-09-30 10:36:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2018-09-30 10:36:24,544 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:24,544 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1]
[2018-09-30 10:36:24,544 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:24,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times
[2018-09-30 10:36:24,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:24,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:24,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:26,103 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:26,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:26,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:36:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:26,170 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:26,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:26,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:26,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:26,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:28,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:28,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112
[2018-09-30 10:36:28,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states
[2018-09-30 10:36:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants.
[2018-09-30 10:36:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882
[2018-09-30 10:36:28,147 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states.
[2018-09-30 10:36:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:28,600 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions.
[2018-09-30 10:36:28,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states.
[2018-09-30 10:36:28,600 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224
[2018-09-30 10:36:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:28,601 INFO L225 Difference]: With dead ends: 231
[2018-09-30 10:36:28,601 INFO L226 Difference]: Without dead ends: 230
[2018-09-30 10:36:28,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882
[2018-09-30 10:36:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states.
[2018-09-30 10:36:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229.
[2018-09-30 10:36:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states.
[2018-09-30 10:36:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions.
[2018-09-30 10:36:28,608 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224
[2018-09-30 10:36:28,608 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:28,608 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions.
[2018-09-30 10:36:28,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states.
[2018-09-30 10:36:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions.
[2018-09-30 10:36:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2018-09-30 10:36:28,610 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:28,610 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1]
[2018-09-30 10:36:28,610 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:28,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times
[2018-09-30 10:36:28,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:28,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:28,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:36:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:30,361 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:30,361 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:30,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:36:30,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:36:30,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:30,438 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:30,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:30,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:30,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:30,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:32,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:32,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114
[2018-09-30 10:36:32,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states
[2018-09-30 10:36:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants.
[2018-09-30 10:36:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340
[2018-09-30 10:36:32,880 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states.
[2018-09-30 10:36:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:33,291 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions.
[2018-09-30 10:36:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2018-09-30 10:36:33,291 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228
[2018-09-30 10:36:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:33,293 INFO L225 Difference]: With dead ends: 235
[2018-09-30 10:36:33,293 INFO L226 Difference]: Without dead ends: 234
[2018-09-30 10:36:33,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340
[2018-09-30 10:36:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2018-09-30 10:36:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233.
[2018-09-30 10:36:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states.
[2018-09-30 10:36:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions.
[2018-09-30 10:36:33,298 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228
[2018-09-30 10:36:33,298 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:33,298 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions.
[2018-09-30 10:36:33,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states.
[2018-09-30 10:36:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions.
[2018-09-30 10:36:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2018-09-30 10:36:33,300 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:33,300 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1]
[2018-09-30 10:36:33,300 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:33,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times
[2018-09-30 10:36:33,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:33,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:33,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:35,250 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:35,250 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:35,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:36:35,507 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s)
[2018-09-30 10:36:35,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:35,513 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:35,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:35,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:35,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:35,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:37,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:37,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116
[2018-09-30 10:36:37,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states
[2018-09-30 10:36:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants.
[2018-09-30 10:36:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806
[2018-09-30 10:36:37,795 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states.
[2018-09-30 10:36:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:38,204 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions.
[2018-09-30 10:36:38,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states.
[2018-09-30 10:36:38,204 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232
[2018-09-30 10:36:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:38,206 INFO L225 Difference]: With dead ends: 239
[2018-09-30 10:36:38,206 INFO L226 Difference]: Without dead ends: 238
[2018-09-30 10:36:38,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806
[2018-09-30 10:36:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2018-09-30 10:36:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237.
[2018-09-30 10:36:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states.
[2018-09-30 10:36:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions.
[2018-09-30 10:36:38,211 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232
[2018-09-30 10:36:38,212 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:38,212 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions.
[2018-09-30 10:36:38,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states.
[2018-09-30 10:36:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions.
[2018-09-30 10:36:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2018-09-30 10:36:38,213 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:38,213 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1]
[2018-09-30 10:36:38,213 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:38,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:38,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times
[2018-09-30 10:36:38,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:38,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:38,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:38,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:38,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:40,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:40,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:36:40,288 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:36:40,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:40,295 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:40,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:40,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:40,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:40,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:42,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:42,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118
[2018-09-30 10:36:42,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states
[2018-09-30 10:36:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants.
[2018-09-30 10:36:42,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280
[2018-09-30 10:36:42,424 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states.
[2018-09-30 10:36:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:42,837 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions.
[2018-09-30 10:36:42,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states.
[2018-09-30 10:36:42,837 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236
[2018-09-30 10:36:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:42,839 INFO L225 Difference]: With dead ends: 243
[2018-09-30 10:36:42,839 INFO L226 Difference]: Without dead ends: 242
[2018-09-30 10:36:42,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280
[2018-09-30 10:36:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2018-09-30 10:36:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241.
[2018-09-30 10:36:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states.
[2018-09-30 10:36:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions.
[2018-09-30 10:36:42,844 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236
[2018-09-30 10:36:42,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:42,844 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions.
[2018-09-30 10:36:42,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states.
[2018-09-30 10:36:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions.
[2018-09-30 10:36:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2018-09-30 10:36:42,845 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:42,845 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1]
[2018-09-30 10:36:42,846 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:42,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times
[2018-09-30 10:36:42,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:42,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:42,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:42,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:45,060 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:45,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:45,068 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:36:45,225 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s)
[2018-09-30 10:36:45,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:45,231 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:45,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:45,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:45,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:47,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:47,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120
[2018-09-30 10:36:47,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states
[2018-09-30 10:36:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants.
[2018-09-30 10:36:47,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762
[2018-09-30 10:36:47,388 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states.
[2018-09-30 10:36:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:47,755 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions.
[2018-09-30 10:36:47,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states.
[2018-09-30 10:36:47,755 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240
[2018-09-30 10:36:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:47,757 INFO L225 Difference]: With dead ends: 247
[2018-09-30 10:36:47,757 INFO L226 Difference]: Without dead ends: 246
[2018-09-30 10:36:47,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762
[2018-09-30 10:36:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states.
[2018-09-30 10:36:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245.
[2018-09-30 10:36:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-09-30 10:36:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions.
[2018-09-30 10:36:47,764 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240
[2018-09-30 10:36:47,764 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:47,764 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions.
[2018-09-30 10:36:47,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states.
[2018-09-30 10:36:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions.
[2018-09-30 10:36:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2018-09-30 10:36:47,766 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:47,766 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1]
[2018-09-30 10:36:47,766 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:47,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times
[2018-09-30 10:36:47,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:47,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:47,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:49,875 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:49,875 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:49,884 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:36:50,106 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s)
[2018-09-30 10:36:50,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:36:50,113 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:50,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:50,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:50,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:50,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:52,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:52,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122
[2018-09-30 10:36:52,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states
[2018-09-30 10:36:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants.
[2018-09-30 10:36:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252
[2018-09-30 10:36:52,394 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states.
[2018-09-30 10:36:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:52,911 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions.
[2018-09-30 10:36:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states.
[2018-09-30 10:36:52,911 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244
[2018-09-30 10:36:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:52,912 INFO L225 Difference]: With dead ends: 251
[2018-09-30 10:36:52,912 INFO L226 Difference]: Without dead ends: 250
[2018-09-30 10:36:52,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252
[2018-09-30 10:36:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2018-09-30 10:36:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249.
[2018-09-30 10:36:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states.
[2018-09-30 10:36:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions.
[2018-09-30 10:36:52,919 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244
[2018-09-30 10:36:52,920 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:52,920 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions.
[2018-09-30 10:36:52,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states.
[2018-09-30 10:36:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions.
[2018-09-30 10:36:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2018-09-30 10:36:52,921 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:52,921 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1]
[2018-09-30 10:36:52,922 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:52,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times
[2018-09-30 10:36:52,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:52,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:52,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:36:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:55,068 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:36:55,068 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:36:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:36:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:36:55,148 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:36:55,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:36:55,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:55,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:36:55,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:36:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:36:57,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:36:57,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124
[2018-09-30 10:36:57,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states
[2018-09-30 10:36:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants.
[2018-09-30 10:36:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750
[2018-09-30 10:36:57,571 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states.
[2018-09-30 10:36:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:36:58,040 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions.
[2018-09-30 10:36:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states.
[2018-09-30 10:36:58,041 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248
[2018-09-30 10:36:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:36:58,042 INFO L225 Difference]: With dead ends: 255
[2018-09-30 10:36:58,042 INFO L226 Difference]: Without dead ends: 254
[2018-09-30 10:36:58,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750
[2018-09-30 10:36:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states.
[2018-09-30 10:36:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253.
[2018-09-30 10:36:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states.
[2018-09-30 10:36:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions.
[2018-09-30 10:36:58,048 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248
[2018-09-30 10:36:58,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:36:58,048 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions.
[2018-09-30 10:36:58,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states.
[2018-09-30 10:36:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions.
[2018-09-30 10:36:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2018-09-30 10:36:58,049 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:36:58,049 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1]
[2018-09-30 10:36:58,049 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:36:58,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:36:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times
[2018-09-30 10:36:58,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:36:58,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:36:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:36:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:36:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:00,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:00,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:00,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:37:00,441 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:37:00,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:00,447 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:00,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:00,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:00,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:00,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:02,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:02,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126
[2018-09-30 10:37:02,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states
[2018-09-30 10:37:02,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants.
[2018-09-30 10:37:02,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256
[2018-09-30 10:37:02,907 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states.
[2018-09-30 10:37:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:03,373 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions.
[2018-09-30 10:37:03,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states.
[2018-09-30 10:37:03,374 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252
[2018-09-30 10:37:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:03,375 INFO L225 Difference]: With dead ends: 259
[2018-09-30 10:37:03,375 INFO L226 Difference]: Without dead ends: 258
[2018-09-30 10:37:03,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256
[2018-09-30 10:37:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states.
[2018-09-30 10:37:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257.
[2018-09-30 10:37:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states.
[2018-09-30 10:37:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions.
[2018-09-30 10:37:03,381 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252
[2018-09-30 10:37:03,381 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:03,381 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions.
[2018-09-30 10:37:03,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states.
[2018-09-30 10:37:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions.
[2018-09-30 10:37:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2018-09-30 10:37:03,382 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:03,382 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1]
[2018-09-30 10:37:03,382 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:03,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times
[2018-09-30 10:37:03,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:03,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:03,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:03,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:05,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:05,793 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:05,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:37:06,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s)
[2018-09-30 10:37:06,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:06,135 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:06,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:06,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:06,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:06,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:08,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:08,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128
[2018-09-30 10:37:08,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states
[2018-09-30 10:37:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants.
[2018-09-30 10:37:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770
[2018-09-30 10:37:08,663 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states.
[2018-09-30 10:37:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:09,133 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions.
[2018-09-30 10:37:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states.
[2018-09-30 10:37:09,134 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256
[2018-09-30 10:37:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:09,135 INFO L225 Difference]: With dead ends: 263
[2018-09-30 10:37:09,135 INFO L226 Difference]: Without dead ends: 262
[2018-09-30 10:37:09,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770
[2018-09-30 10:37:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states.
[2018-09-30 10:37:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261.
[2018-09-30 10:37:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states.
[2018-09-30 10:37:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions.
[2018-09-30 10:37:09,142 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256
[2018-09-30 10:37:09,142 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:09,142 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions.
[2018-09-30 10:37:09,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states.
[2018-09-30 10:37:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions.
[2018-09-30 10:37:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2018-09-30 10:37:09,144 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:09,144 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1]
[2018-09-30 10:37:09,144 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:09,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times
[2018-09-30 10:37:09,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:09,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:09,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:09,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:11,451 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:11,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:37:11,539 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:37:11,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:11,547 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:11,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:11,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:11,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:11,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:14,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:14,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130
[2018-09-30 10:37:14,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states
[2018-09-30 10:37:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants.
[2018-09-30 10:37:14,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292
[2018-09-30 10:37:14,379 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states.
[2018-09-30 10:37:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:14,984 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions.
[2018-09-30 10:37:14,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states.
[2018-09-30 10:37:14,984 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260
[2018-09-30 10:37:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:14,985 INFO L225 Difference]: With dead ends: 267
[2018-09-30 10:37:14,986 INFO L226 Difference]: Without dead ends: 266
[2018-09-30 10:37:14,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292
[2018-09-30 10:37:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2018-09-30 10:37:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265.
[2018-09-30 10:37:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states.
[2018-09-30 10:37:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions.
[2018-09-30 10:37:14,992 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260
[2018-09-30 10:37:14,992 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:14,992 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions.
[2018-09-30 10:37:14,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states.
[2018-09-30 10:37:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions.
[2018-09-30 10:37:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265
[2018-09-30 10:37:14,994 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:14,994 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1]
[2018-09-30 10:37:14,994 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:14,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times
[2018-09-30 10:37:14,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:14,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:17,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:17,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:37:17,350 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s)
[2018-09-30 10:37:17,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:17,357 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:17,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:17,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:17,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:17,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:20,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:20,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132
[2018-09-30 10:37:20,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states
[2018-09-30 10:37:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants.
[2018-09-30 10:37:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822
[2018-09-30 10:37:20,217 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states.
[2018-09-30 10:37:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:20,713 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions.
[2018-09-30 10:37:20,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2018-09-30 10:37:20,714 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264
[2018-09-30 10:37:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:20,716 INFO L225 Difference]: With dead ends: 271
[2018-09-30 10:37:20,716 INFO L226 Difference]: Without dead ends: 270
[2018-09-30 10:37:20,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822
[2018-09-30 10:37:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states.
[2018-09-30 10:37:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269.
[2018-09-30 10:37:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states.
[2018-09-30 10:37:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions.
[2018-09-30 10:37:20,723 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264
[2018-09-30 10:37:20,723 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:20,723 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions.
[2018-09-30 10:37:20,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states.
[2018-09-30 10:37:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions.
[2018-09-30 10:37:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269
[2018-09-30 10:37:20,724 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:20,725 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1]
[2018-09-30 10:37:20,725 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:20,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times
[2018-09-30 10:37:20,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:20,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:20,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:22,923 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:22,923 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:22,931 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:37:23,182 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s)
[2018-09-30 10:37:23,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:23,189 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:23,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:23,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:23,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:23,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:26,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:26,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134
[2018-09-30 10:37:26,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states
[2018-09-30 10:37:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants.
[2018-09-30 10:37:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360
[2018-09-30 10:37:26,132 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states.
[2018-09-30 10:37:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:26,680 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions.
[2018-09-30 10:37:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states.
[2018-09-30 10:37:26,681 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268
[2018-09-30 10:37:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:26,682 INFO L225 Difference]: With dead ends: 275
[2018-09-30 10:37:26,682 INFO L226 Difference]: Without dead ends: 274
[2018-09-30 10:37:26,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360
[2018-09-30 10:37:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states.
[2018-09-30 10:37:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273.
[2018-09-30 10:37:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states.
[2018-09-30 10:37:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions.
[2018-09-30 10:37:26,688 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268
[2018-09-30 10:37:26,688 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:26,688 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions.
[2018-09-30 10:37:26,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states.
[2018-09-30 10:37:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions.
[2018-09-30 10:37:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2018-09-30 10:37:26,689 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:26,690 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1]
[2018-09-30 10:37:26,690 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:26,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:26,690 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times
[2018-09-30 10:37:26,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:26,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:26,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:26,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:26,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:28,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:28,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:28,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:37:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:29,057 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:29,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:29,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:29,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:29,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:31,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:31,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136
[2018-09-30 10:37:31,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states
[2018-09-30 10:37:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants.
[2018-09-30 10:37:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906
[2018-09-30 10:37:31,968 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states.
[2018-09-30 10:37:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:32,402 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions.
[2018-09-30 10:37:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states.
[2018-09-30 10:37:32,402 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272
[2018-09-30 10:37:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:32,404 INFO L225 Difference]: With dead ends: 279
[2018-09-30 10:37:32,404 INFO L226 Difference]: Without dead ends: 278
[2018-09-30 10:37:32,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906
[2018-09-30 10:37:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states.
[2018-09-30 10:37:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277.
[2018-09-30 10:37:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states.
[2018-09-30 10:37:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions.
[2018-09-30 10:37:32,410 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272
[2018-09-30 10:37:32,411 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:32,411 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions.
[2018-09-30 10:37:32,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states.
[2018-09-30 10:37:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions.
[2018-09-30 10:37:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277
[2018-09-30 10:37:32,412 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:32,412 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1]
[2018-09-30 10:37:32,413 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:32,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times
[2018-09-30 10:37:32,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:32,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:37:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:34,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:34,747 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:37:34,823 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:37:34,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:34,829 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:34,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:34,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:34,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:34,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:37,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:37,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138
[2018-09-30 10:37:37,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states
[2018-09-30 10:37:37,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants.
[2018-09-30 10:37:37,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460
[2018-09-30 10:37:37,904 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states.
[2018-09-30 10:37:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:38,410 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions.
[2018-09-30 10:37:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2018-09-30 10:37:38,410 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276
[2018-09-30 10:37:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:38,412 INFO L225 Difference]: With dead ends: 283
[2018-09-30 10:37:38,412 INFO L226 Difference]: Without dead ends: 282
[2018-09-30 10:37:38,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460
[2018-09-30 10:37:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states.
[2018-09-30 10:37:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281.
[2018-09-30 10:37:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states.
[2018-09-30 10:37:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions.
[2018-09-30 10:37:38,420 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276
[2018-09-30 10:37:38,420 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:38,421 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions.
[2018-09-30 10:37:38,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states.
[2018-09-30 10:37:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions.
[2018-09-30 10:37:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281
[2018-09-30 10:37:38,422 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:38,422 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1]
[2018-09-30 10:37:38,422 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:38,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times
[2018-09-30 10:37:38,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:38,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:38,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:38,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:41,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:41,067 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:41,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:37:41,447 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s)
[2018-09-30 10:37:41,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:41,454 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:41,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:41,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:41,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:41,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:44,336 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:44,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140
[2018-09-30 10:37:44,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states
[2018-09-30 10:37:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants.
[2018-09-30 10:37:44,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022
[2018-09-30 10:37:44,338 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states.
[2018-09-30 10:37:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:44,794 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions.
[2018-09-30 10:37:44,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2018-09-30 10:37:44,794 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280
[2018-09-30 10:37:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:44,796 INFO L225 Difference]: With dead ends: 287
[2018-09-30 10:37:44,796 INFO L226 Difference]: Without dead ends: 286
[2018-09-30 10:37:44,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022
[2018-09-30 10:37:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states.
[2018-09-30 10:37:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285.
[2018-09-30 10:37:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states.
[2018-09-30 10:37:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions.
[2018-09-30 10:37:44,801 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280
[2018-09-30 10:37:44,801 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:44,802 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions.
[2018-09-30 10:37:44,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states.
[2018-09-30 10:37:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions.
[2018-09-30 10:37:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285
[2018-09-30 10:37:44,803 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:44,803 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1]
[2018-09-30 10:37:44,803 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:44,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times
[2018-09-30 10:37:44,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:44,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:44,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:47,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:47,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:47,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-09-30 10:37:47,668 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-09-30 10:37:47,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:47,675 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:47,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:47,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:47,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:47,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:50,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:50,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142
[2018-09-30 10:37:50,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states
[2018-09-30 10:37:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants.
[2018-09-30 10:37:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592
[2018-09-30 10:37:50,902 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states.
[2018-09-30 10:37:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:51,470 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions.
[2018-09-30 10:37:51,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states.
[2018-09-30 10:37:51,471 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284
[2018-09-30 10:37:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:51,473 INFO L225 Difference]: With dead ends: 291
[2018-09-30 10:37:51,473 INFO L226 Difference]: Without dead ends: 290
[2018-09-30 10:37:51,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592
[2018-09-30 10:37:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2018-09-30 10:37:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289.
[2018-09-30 10:37:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states.
[2018-09-30 10:37:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions.
[2018-09-30 10:37:51,478 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284
[2018-09-30 10:37:51,478 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:51,478 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions.
[2018-09-30 10:37:51,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states.
[2018-09-30 10:37:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions.
[2018-09-30 10:37:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2018-09-30 10:37:51,479 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:51,479 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1]
[2018-09-30 10:37:51,480 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:51,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times
[2018-09-30 10:37:51,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:51,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:51,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:37:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:54,087 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:37:54,087 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:37:54,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-09-30 10:37:54,317 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s)
[2018-09-30 10:37:54,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:37:54,324 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:37:54,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:37:54,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:54,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:37:54,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:37:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:37:57,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:37:57,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144
[2018-09-30 10:37:57,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states
[2018-09-30 10:37:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants.
[2018-09-30 10:37:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170
[2018-09-30 10:37:57,600 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states.
[2018-09-30 10:37:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:37:58,094 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions.
[2018-09-30 10:37:58,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states.
[2018-09-30 10:37:58,094 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288
[2018-09-30 10:37:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:37:58,096 INFO L225 Difference]: With dead ends: 295
[2018-09-30 10:37:58,096 INFO L226 Difference]: Without dead ends: 294
[2018-09-30 10:37:58,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170
[2018-09-30 10:37:58,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2018-09-30 10:37:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293.
[2018-09-30 10:37:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states.
[2018-09-30 10:37:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions.
[2018-09-30 10:37:58,102 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288
[2018-09-30 10:37:58,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:37:58,103 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions.
[2018-09-30 10:37:58,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states.
[2018-09-30 10:37:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions.
[2018-09-30 10:37:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293
[2018-09-30 10:37:58,104 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:37:58,104 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1]
[2018-09-30 10:37:58,104 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:37:58,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:37:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times
[2018-09-30 10:37:58,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:37:58,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:37:58,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:58,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:37:58,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:37:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:38:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:00,887 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:38:00,887 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:38:00,893 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-09-30 10:38:01,199 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s)
[2018-09-30 10:38:01,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:38:01,206 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:38:01,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:38:01,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:01,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:01,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:38:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:04,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:38:04,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146
[2018-09-30 10:38:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states
[2018-09-30 10:38:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants.
[2018-09-30 10:38:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756
[2018-09-30 10:38:04,409 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states.
[2018-09-30 10:38:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:38:04,894 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions.
[2018-09-30 10:38:04,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states.
[2018-09-30 10:38:04,895 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292
[2018-09-30 10:38:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:38:04,897 INFO L225 Difference]: With dead ends: 299
[2018-09-30 10:38:04,897 INFO L226 Difference]: Without dead ends: 298
[2018-09-30 10:38:04,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756
[2018-09-30 10:38:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states.
[2018-09-30 10:38:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297.
[2018-09-30 10:38:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states.
[2018-09-30 10:38:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions.
[2018-09-30 10:38:04,903 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292
[2018-09-30 10:38:04,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:38:04,903 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions.
[2018-09-30 10:38:04,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states.
[2018-09-30 10:38:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions.
[2018-09-30 10:38:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297
[2018-09-30 10:38:04,904 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:38:04,904 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1]
[2018-09-30 10:38:04,904 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:38:04,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:38:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times
[2018-09-30 10:38:04,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:38:04,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:38:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:04,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:38:04,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:38:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:07,618 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:38:07,618 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:38:07,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:38:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:38:07,703 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:38:07,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:38:07,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:07,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:07,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:38:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:10,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:38:10,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148
[2018-09-30 10:38:10,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states
[2018-09-30 10:38:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants.
[2018-09-30 10:38:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350
[2018-09-30 10:38:10,931 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states.
[2018-09-30 10:38:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:38:11,412 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions.
[2018-09-30 10:38:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2018-09-30 10:38:11,413 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296
[2018-09-30 10:38:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:38:11,415 INFO L225 Difference]: With dead ends: 303
[2018-09-30 10:38:11,415 INFO L226 Difference]: Without dead ends: 302
[2018-09-30 10:38:11,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350
[2018-09-30 10:38:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2018-09-30 10:38:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301.
[2018-09-30 10:38:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states.
[2018-09-30 10:38:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions.
[2018-09-30 10:38:11,421 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296
[2018-09-30 10:38:11,421 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:38:11,421 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions.
[2018-09-30 10:38:11,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states.
[2018-09-30 10:38:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions.
[2018-09-30 10:38:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301
[2018-09-30 10:38:11,422 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:38:11,422 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1]
[2018-09-30 10:38:11,423 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:38:11,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:38:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times
[2018-09-30 10:38:11,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:38:11,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:38:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:38:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:38:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:14,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:38:14,110 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:38:14,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-09-30 10:38:14,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-09-30 10:38:14,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:38:14,199 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:38:14,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:38:14,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:14,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:14,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:38:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:17,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:38:17,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150
[2018-09-30 10:38:17,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states
[2018-09-30 10:38:17,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants.
[2018-09-30 10:38:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952
[2018-09-30 10:38:17,474 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states.
[2018-09-30 10:38:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:38:17,958 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions.
[2018-09-30 10:38:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2018-09-30 10:38:17,958 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300
[2018-09-30 10:38:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:38:17,960 INFO L225 Difference]: With dead ends: 307
[2018-09-30 10:38:17,960 INFO L226 Difference]: Without dead ends: 306
[2018-09-30 10:38:17,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952
[2018-09-30 10:38:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2018-09-30 10:38:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305.
[2018-09-30 10:38:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states.
[2018-09-30 10:38:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions.
[2018-09-30 10:38:17,966 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300
[2018-09-30 10:38:17,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:38:17,966 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions.
[2018-09-30 10:38:17,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states.
[2018-09-30 10:38:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions.
[2018-09-30 10:38:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305
[2018-09-30 10:38:17,967 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:38:17,967 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1]
[2018-09-30 10:38:17,967 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:38:17,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:38:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times
[2018-09-30 10:38:17,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:38:17,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:38:17,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:17,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:38:17,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:38:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:20,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:38:20,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-09-30 10:38:20,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-09-30 10:38:21,144 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s)
[2018-09-30 10:38:21,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-09-30 10:38:21,152 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:38:21,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-09-30 10:38:21,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:21,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-09-30 10:38:21,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-09-30 10:38:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:38:24,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:38:24,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152
[2018-09-30 10:38:24,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states
[2018-09-30 10:38:24,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants.
[2018-09-30 10:38:24,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562
[2018-09-30 10:38:24,467 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states.
[2018-09-30 10:38:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:38:24,994 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions.
[2018-09-30 10:38:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2018-09-30 10:38:24,994 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304
[2018-09-30 10:38:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:38:24,996 INFO L225 Difference]: With dead ends: 311
[2018-09-30 10:38:24,996 INFO L226 Difference]: Without dead ends: 310
[2018-09-30 10:38:24,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562
[2018-09-30 10:38:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states.
[2018-09-30 10:38:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309.
[2018-09-30 10:38:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states.
[2018-09-30 10:38:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions.
[2018-09-30 10:38:25,002 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304
[2018-09-30 10:38:25,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:38:25,002 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions.
[2018-09-30 10:38:25,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states.
[2018-09-30 10:38:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions.
[2018-09-30 10:38:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309
[2018-09-30 10:38:25,003 INFO L367 BasicCegarLoop]: Found error trace
[2018-09-30 10:38:25,004 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1]
[2018-09-30 10:38:25,004 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:38:25,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:38:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times
[2018-09-30 10:38:25,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:38:25,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:38:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:25,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-09-30 10:38:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:38:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
Received shutdown request...
[2018-09-30 10:38:25,558 WARN L549 AbstractCegarLoop]: Verification canceled
[2018-09-30 10:38:25,665 WARN L206 ceAbstractionStarter]: Timeout
[2018-09-30 10:38:25,665 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:38:25 BoogieIcfgContainer
[2018-09-30 10:38:25,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-09-30 10:38:25,666 INFO L168 Benchmark]: Toolchain (without parser) took 237399.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.6 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -715.7 MB). Peak memory consumption was 313.4 MB. Max. memory is 7.1 GB.
[2018-09-30 10:38:25,668 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-09-30 10:38:25,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-09-30 10:38:25,668 INFO L168 Benchmark]: Boogie Preprocessor took 25.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-09-30 10:38:25,668 INFO L168 Benchmark]: RCFGBuilder took 347.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
[2018-09-30 10:38:25,669 INFO L168 Benchmark]: TraceAbstraction took 236961.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -736.8 MB). Peak memory consumption was 292.3 MB. Max. memory is 7.1 GB.
[2018-09-30 10:38:25,670 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 59.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 25.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* RCFGBuilder took 347.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 236961.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 681.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -736.8 MB). Peak memory consumption was 292.3 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 29 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 236.8s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 4233 SDslu, 4298 SDs, 0 SdLazy, 16000 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 184.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=76, 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, 76 MinimizatonAttempts, 76 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 196.7s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-38-25-678.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-38-25-678.csv
Completed graceful shutdown