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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:55:01,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:55:01,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:55:01,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:55:01,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:55:01,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:55:01,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:55:01,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:55:01,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:55:01,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:55:01,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:55:01,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:55:01,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:55:01,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:55:01,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:55:02,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:55:02,009 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:55:02,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:55:02,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:55:02,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:55:02,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:55:02,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:55:02,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:55:02,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:55:02,020 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:55:02,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:55:02,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:55:02,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:55:02,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:55:02,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:55:02,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:55:02,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:55:02,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:55:02,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:55:02,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:55:02,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:55:02,027 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-10-02 11:55:02,043 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:55:02,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:55:02,044 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:55:02,044 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:55:02,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:55:02,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:55:02,045 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:55:02,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:55:02,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:55:02,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:55:02,046 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:55:02,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:55:02,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:55:02,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:55:02,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:55:02,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:55:02,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:55:02,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:55:02,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:55:02,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:55:02,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:55:02,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:55:02,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:55:02,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:55:02,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:55:02,049 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:55:02,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:55:02,049 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:55:02,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:55:02,050 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:55:02,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:55:02,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:55:02,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:55:02,120 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:55:02,120 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:55:02,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-10-02 11:55:02,121 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-10-02 11:55:02,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:55:02,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:55:02,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:55:02,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:55:02,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:55:02,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:55:02,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:55:02,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:55:02,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:55:02,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... [2018-10-02 11:55:02,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:55:02,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:55:02,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:55:02,262 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:55:02,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:55:02,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:55:02,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:55:02,708 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:55:02,711 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:55:02 BoogieIcfgContainer [2018-10-02 11:55:02,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:55:02,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:55:02,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:55:02,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:55:02,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:55:02" (1/2) ... [2018-10-02 11:55:02,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc1ea2a and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:55:02, skipping insertion in model container [2018-10-02 11:55:02,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:55:02" (2/2) ... [2018-10-02 11:55:02,720 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-10-02 11:55:02,730 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:55:02,747 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-02 11:55:02,851 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:55:02,852 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:55:02,853 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:55:02,853 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:55:02,853 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:55:02,853 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:55:02,853 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:55:02,854 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:55:02,854 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:55:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-10-02 11:55:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:55:02,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:02,878 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:55:02,880 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:02,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-10-02 11:55:02,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:02,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:02,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:03,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:55:03,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:55:03,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:55:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:55:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:55:03,143 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-10-02 11:55:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:03,264 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-02 11:55:03,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:55:03,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-02 11:55:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:03,286 INFO L225 Difference]: With dead ends: 24 [2018-10-02 11:55:03,286 INFO L226 Difference]: Without dead ends: 11 [2018-10-02 11:55:03,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:55:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-02 11:55:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-10-02 11:55:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-02 11:55:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-02 11:55:03,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-10-02 11:55:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:03,328 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-02 11:55:03,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:55:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-02 11:55:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-02 11:55:03,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:03,329 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-02 11:55:03,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:03,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-10-02 11:55:03,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:03,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:03,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:55:03,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:55:03,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:55:03,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:55:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:55:03,634 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-10-02 11:55:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:03,868 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-02 11:55:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:55:03,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-02 11:55:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:03,869 INFO L225 Difference]: With dead ends: 18 [2018-10-02 11:55:03,870 INFO L226 Difference]: Without dead ends: 17 [2018-10-02 11:55:03,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:55:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-02 11:55:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-10-02 11:55:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 11:55:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-02 11:55:03,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-10-02 11:55:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:03,877 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-02 11:55:03,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:55:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-02 11:55:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:55:03,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:03,878 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:55:03,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:03,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-10-02 11:55:03,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:03,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:03,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:03,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:03,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:55:03,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:55:03,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:55:03,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:55:03,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:55:03,966 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-10-02 11:55:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:03,996 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-02 11:55:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:55:03,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-02 11:55:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:03,997 INFO L225 Difference]: With dead ends: 19 [2018-10-02 11:55:03,998 INFO L226 Difference]: Without dead ends: 12 [2018-10-02 11:55:03,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-02 11:55:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-02 11:55:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-02 11:55:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-02 11:55:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-02 11:55:04,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-10-02 11:55:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:04,006 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-02 11:55:04,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:55:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-02 11:55:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-02 11:55:04,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:04,007 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:55:04,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:04,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-10-02 11:55:04,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:04,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:04,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:04,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:04,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:04,240 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:04,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:04,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:04,337 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-10-02 11:55:04,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:04,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:04,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:04,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-02 11:55:04,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:55:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:55:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:55:04,478 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-10-02 11:55:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:04,733 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-02 11:55:04,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:55:04,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-02 11:55:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:04,735 INFO L225 Difference]: With dead ends: 21 [2018-10-02 11:55:04,735 INFO L226 Difference]: Without dead ends: 20 [2018-10-02 11:55:04,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:55:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-02 11:55:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-02 11:55:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-02 11:55:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-02 11:55:04,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-02 11:55:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:04,742 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-02 11:55:04,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:55:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-02 11:55:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:55:04,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:04,743 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-10-02 11:55:04,743 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:04,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-10-02 11:55:04,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:04,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:04,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:04,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:04,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:04,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:04,935 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:04,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:04,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:04,964 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-10-02 11:55:04,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:05,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:05,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:05,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:05,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-02 11:55:05,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:55:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:55:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:55:05,223 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-02 11:55:05,469 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-02 11:55:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:05,773 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-02 11:55:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:55:05,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-02 11:55:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:05,774 INFO L225 Difference]: With dead ends: 26 [2018-10-02 11:55:05,774 INFO L226 Difference]: Without dead ends: 25 [2018-10-02 11:55:05,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:55:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-02 11:55:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-02 11:55:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 11:55:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-02 11:55:05,780 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-02 11:55:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:05,780 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-02 11:55:05,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:55:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-02 11:55:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:55:05,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:05,782 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-10-02 11:55:05,782 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:05,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-10-02 11:55:05,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:05,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:05,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:05,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:05,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:05,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:05,935 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:05,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-02 11:55:05,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:05,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:06,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:06,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:06,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:06,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:06,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:06,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-02 11:55:06,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:55:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:55:06,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:55:06,177 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-10-02 11:55:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:06,436 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-02 11:55:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:55:06,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-02 11:55:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:06,438 INFO L225 Difference]: With dead ends: 31 [2018-10-02 11:55:06,438 INFO L226 Difference]: Without dead ends: 30 [2018-10-02 11:55:06,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:55:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-02 11:55:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-02 11:55:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 11:55:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-02 11:55:06,446 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-02 11:55:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:06,446 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-02 11:55:06,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:55:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-02 11:55:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-02 11:55:06,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:06,448 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-10-02 11:55:06,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:06,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-10-02 11:55:06,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:06,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:06,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:06,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:06,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:06,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:06,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:06,713 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:06,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:06,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:06,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-10-02 11:55:06,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:06,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:06,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:06,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:06,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:55:06,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:55:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:55:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:55:06,900 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-02 11:55:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:07,141 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-02 11:55:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 11:55:07,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-02 11:55:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:07,142 INFO L225 Difference]: With dead ends: 36 [2018-10-02 11:55:07,142 INFO L226 Difference]: Without dead ends: 35 [2018-10-02 11:55:07,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:55:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-02 11:55:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-02 11:55:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-02 11:55:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-02 11:55:07,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-02 11:55:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:07,151 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-02 11:55:07,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:55:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-02 11:55:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 11:55:07,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:07,152 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-10-02 11:55:07,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:07,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:07,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-10-02 11:55:07,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:07,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:07,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:07,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:07,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:07,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:07,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:07,485 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-02 11:55:07,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:07,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:07,500 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-10-02 11:55:07,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:07,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:07,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:07,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:07,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-02 11:55:07,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:55:07,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:55:07,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:55:07,675 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-10-02 11:55:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:08,247 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-02 11:55:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:55:08,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-10-02 11:55:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:08,249 INFO L225 Difference]: With dead ends: 41 [2018-10-02 11:55:08,249 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 11:55:08,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:55:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 11:55:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-10-02 11:55:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-02 11:55:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-02 11:55:08,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-02 11:55:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:08,258 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-02 11:55:08,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:55:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-02 11:55:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:55:08,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:08,260 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-10-02 11:55:08,260 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:08,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:08,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-10-02 11:55:08,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:08,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:08,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:08,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:08,429 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:08,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:08,567 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-02 11:55:08,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:08,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:08,596 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-10-02 11:55:08,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:08,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:08,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:09,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:09,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-02 11:55:09,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:55:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:55:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:55:09,020 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-10-02 11:55:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:09,406 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-02 11:55:09,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:55:09,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-10-02 11:55:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:09,408 INFO L225 Difference]: With dead ends: 46 [2018-10-02 11:55:09,408 INFO L226 Difference]: Without dead ends: 45 [2018-10-02 11:55:09,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:55:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-02 11:55:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-02 11:55:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-02 11:55:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-02 11:55:09,417 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-02 11:55:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:09,417 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-02 11:55:09,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:55:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-02 11:55:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 11:55:09,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:09,419 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-10-02 11:55:09,419 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:09,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-10-02 11:55:09,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:09,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:09,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:09,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:09,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:09,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:09,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:09,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:09,701 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-10-02 11:55:09,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:09,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:09,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:10,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:10,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 11:55:10,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:55:10,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:55:10,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:55:10,166 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-10-02 11:55:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:10,552 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-02 11:55:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:55:10,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-10-02 11:55:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:10,561 INFO L225 Difference]: With dead ends: 51 [2018-10-02 11:55:10,561 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 11:55:10,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:55:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 11:55:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-02 11:55:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-02 11:55:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-02 11:55:10,569 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-02 11:55:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:10,570 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-02 11:55:10,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:55:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-02 11:55:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-02 11:55:10,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:10,571 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-10-02 11:55:10,571 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-10-02 11:55:10,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:10,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:10,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:10,904 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:10,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:10,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:10,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:10,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:10,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:10,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:11,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:11,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-02 11:55:11,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 11:55:11,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 11:55:11,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:55:11,177 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-10-02 11:55:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:11,613 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-02 11:55:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:55:11,613 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-10-02 11:55:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:11,615 INFO L225 Difference]: With dead ends: 56 [2018-10-02 11:55:11,615 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 11:55:11,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:55:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 11:55:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-10-02 11:55:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-02 11:55:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-02 11:55:11,624 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-10-02 11:55:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:11,625 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-02 11:55:11,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 11:55:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-02 11:55:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-02 11:55:11,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:11,626 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-10-02 11:55:11,626 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:11,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-10-02 11:55:11,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:11,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:11,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:11,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:11,862 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:11,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:11,919 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-02 11:55:11,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:11,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:11,947 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-10-02 11:55:11,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:11,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:11,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:12,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-02 11:55:12,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 11:55:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 11:55:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:55:12,222 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-10-02 11:55:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:12,784 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-02 11:55:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:55:12,785 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-10-02 11:55:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:12,786 INFO L225 Difference]: With dead ends: 61 [2018-10-02 11:55:12,786 INFO L226 Difference]: Without dead ends: 60 [2018-10-02 11:55:12,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:55:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-02 11:55:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-10-02 11:55:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:55:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-02 11:55:12,806 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-10-02 11:55:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:12,806 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-02 11:55:12,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 11:55:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-02 11:55:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-02 11:55:12,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:12,811 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-10-02 11:55:12,811 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:12,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-10-02 11:55:12,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:12,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:12,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:12,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:12,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:13,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:13,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:13,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:13,149 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:13,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:13,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:13,172 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-10-02 11:55:13,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:13,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:13,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:13,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-02 11:55:13,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-02 11:55:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-02 11:55:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:55:13,408 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-02 11:55:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:13,905 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-02 11:55:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:55:13,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-02 11:55:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:13,907 INFO L225 Difference]: With dead ends: 66 [2018-10-02 11:55:13,907 INFO L226 Difference]: Without dead ends: 65 [2018-10-02 11:55:13,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:55:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-02 11:55:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-02 11:55:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-02 11:55:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-02 11:55:13,928 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-10-02 11:55:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:13,928 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-02 11:55:13,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-02 11:55:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-02 11:55:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-02 11:55:13,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:13,930 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-10-02 11:55:13,932 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:13,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-10-02 11:55:13,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:13,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:13,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:14,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:14,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:14,270 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-02 11:55:14,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:14,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:14,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:55:14,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:14,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:14,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:14,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-02 11:55:14,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-02 11:55:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-02 11:55:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:55:14,586 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-10-02 11:55:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:15,115 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-02 11:55:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:55:15,116 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-10-02 11:55:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:15,116 INFO L225 Difference]: With dead ends: 71 [2018-10-02 11:55:15,117 INFO L226 Difference]: Without dead ends: 70 [2018-10-02 11:55:15,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:55:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-02 11:55:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-02 11:55:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-02 11:55:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-02 11:55:15,130 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-10-02 11:55:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:15,130 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-02 11:55:15,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-02 11:55:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-02 11:55:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-02 11:55:15,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:15,132 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-10-02 11:55:15,132 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:15,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-10-02 11:55:15,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:15,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:16,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:16,139 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:16,150 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:16,215 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-02 11:55:16,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:16,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:16,241 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-10-02 11:55:16,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:16,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:16,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:16,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:16,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-02 11:55:16,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-02 11:55:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-02 11:55:16,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-10-02 11:55:16,510 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-10-02 11:55:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:17,003 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-02 11:55:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:55:17,003 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-10-02 11:55:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:17,004 INFO L225 Difference]: With dead ends: 76 [2018-10-02 11:55:17,005 INFO L226 Difference]: Without dead ends: 75 [2018-10-02 11:55:17,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:55:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-02 11:55:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-02 11:55:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-02 11:55:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-02 11:55:17,018 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-10-02 11:55:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:17,018 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-02 11:55:17,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-02 11:55:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-02 11:55:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-02 11:55:17,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:17,019 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-10-02 11:55:17,020 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:17,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-10-02 11:55:17,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:17,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:17,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:17,463 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:17,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:17,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:17,558 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-10-02 11:55:17,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:17,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-10-02 11:55:17,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:17,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:17,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-02 11:55:17,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-02 11:55:17,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-02 11:55:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:55:17,946 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-10-02 11:55:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:18,584 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-02 11:55:18,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:55:18,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-10-02 11:55:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:18,586 INFO L225 Difference]: With dead ends: 81 [2018-10-02 11:55:18,586 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 11:55:18,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-10-02 11:55:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 11:55:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-10-02 11:55:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-02 11:55:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-02 11:55:18,598 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-10-02 11:55:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:18,598 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-02 11:55:18,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-02 11:55:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-02 11:55:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-02 11:55:18,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:18,600 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-10-02 11:55:18,600 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:18,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-10-02 11:55:18,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:18,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:18,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:18,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:18,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:18,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:18,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:19,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:19,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:19,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:19,038 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-10-02 11:55:19,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:19,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:19,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:19,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:19,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-02 11:55:19,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-02 11:55:19,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-02 11:55:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:55:19,374 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-10-02 11:55:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:19,978 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-02 11:55:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:55:19,979 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-10-02 11:55:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:19,980 INFO L225 Difference]: With dead ends: 86 [2018-10-02 11:55:19,980 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 11:55:19,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:55:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 11:55:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-02 11:55:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-02 11:55:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-02 11:55:19,996 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-10-02 11:55:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:19,996 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-02 11:55:19,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-02 11:55:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-02 11:55:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-02 11:55:19,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:19,998 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-10-02 11:55:19,998 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:19,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-10-02 11:55:19,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:19,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:20,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:20,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:20,516 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:20,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:20,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-02 11:55:20,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:20,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:20,646 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-10-02 11:55:20,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:20,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:20,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:21,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:21,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-02 11:55:21,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-02 11:55:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-02 11:55:21,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:55:21,231 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-10-02 11:55:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:21,802 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-02 11:55:21,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:55:21,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-10-02 11:55:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:21,804 INFO L225 Difference]: With dead ends: 91 [2018-10-02 11:55:21,804 INFO L226 Difference]: Without dead ends: 90 [2018-10-02 11:55:21,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:55:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-02 11:55:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-10-02 11:55:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-02 11:55:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-02 11:55:21,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-10-02 11:55:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:21,818 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-02 11:55:21,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-02 11:55:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-02 11:55:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 11:55:21,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:21,819 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-10-02 11:55:21,819 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-10-02 11:55:21,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:21,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:22,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:22,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:22,783 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:22,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:22,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:22,789 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-10-02 11:55:22,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:22,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:22,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:23,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:23,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-02 11:55:23,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-02 11:55:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-02 11:55:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:55:23,226 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-10-02 11:55:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:23,830 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-02 11:55:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:55:23,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-10-02 11:55:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:23,832 INFO L225 Difference]: With dead ends: 96 [2018-10-02 11:55:23,832 INFO L226 Difference]: Without dead ends: 95 [2018-10-02 11:55:23,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-10-02 11:55:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-02 11:55:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-02 11:55:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-02 11:55:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-02 11:55:23,843 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-10-02 11:55:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:23,843 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-02 11:55:23,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-02 11:55:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-02 11:55:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-02 11:55:23,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:23,844 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-10-02 11:55:23,844 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:23,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-10-02 11:55:23,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:23,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:23,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:24,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:24,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:24,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:24,734 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-02 11:55:24,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:24,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:24,741 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-10-02 11:55:24,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:24,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:24,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:25,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-02 11:55:25,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-02 11:55:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-02 11:55:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-10-02 11:55:25,104 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-10-02 11:55:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:25,930 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-02 11:55:25,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:55:25,930 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-10-02 11:55:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:25,931 INFO L225 Difference]: With dead ends: 101 [2018-10-02 11:55:25,931 INFO L226 Difference]: Without dead ends: 100 [2018-10-02 11:55:25,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:55:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-02 11:55:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-02 11:55:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-02 11:55:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-02 11:55:25,944 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-10-02 11:55:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:25,944 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-02 11:55:25,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-02 11:55:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-02 11:55:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-02 11:55:25,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:25,945 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-10-02 11:55:25,946 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:25,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-10-02 11:55:25,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:25,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:25,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:25,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:26,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:26,448 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:26,655 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-02 11:55:26,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:26,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:26,670 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-10-02 11:55:26,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:26,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:26,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:27,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:27,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-02 11:55:27,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-02 11:55:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-02 11:55:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-10-02 11:55:27,050 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-10-02 11:55:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:27,781 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-02 11:55:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 11:55:27,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-10-02 11:55:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:27,782 INFO L225 Difference]: With dead ends: 106 [2018-10-02 11:55:27,782 INFO L226 Difference]: Without dead ends: 105 [2018-10-02 11:55:27,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-10-02 11:55:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-02 11:55:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-02 11:55:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-02 11:55:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-02 11:55:27,795 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-10-02 11:55:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:27,796 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-02 11:55:27,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-02 11:55:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-02 11:55:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-02 11:55:27,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:27,797 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-10-02 11:55:27,797 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:27,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:27,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-10-02 11:55:27,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:27,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:27,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:28,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:28,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:28,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:28,269 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-10-02 11:55:28,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:28,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:28,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:28,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:28,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-02 11:55:28,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-02 11:55:28,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-02 11:55:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-10-02 11:55:28,711 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-10-02 11:55:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:29,395 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-02 11:55:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:55:29,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-10-02 11:55:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:29,397 INFO L225 Difference]: With dead ends: 111 [2018-10-02 11:55:29,397 INFO L226 Difference]: Without dead ends: 110 [2018-10-02 11:55:29,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:55:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-02 11:55:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-10-02 11:55:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-02 11:55:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-02 11:55:29,410 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-10-02 11:55:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:29,411 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-02 11:55:29,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-02 11:55:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-02 11:55:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-02 11:55:29,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:29,412 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-10-02 11:55:29,412 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:29,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-10-02 11:55:29,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:29,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:30,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:30,013 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:30,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:30,098 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:30,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:30,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:30,106 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-10-02 11:55:30,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:30,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:30,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:31,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:31,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-02 11:55:31,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-02 11:55:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-02 11:55:31,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-10-02 11:55:31,764 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-10-02 11:55:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:32,583 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-02 11:55:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:55:32,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-10-02 11:55:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:32,585 INFO L225 Difference]: With dead ends: 116 [2018-10-02 11:55:32,585 INFO L226 Difference]: Without dead ends: 115 [2018-10-02 11:55:32,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1517, Invalid=2905, Unknown=0, NotChecked=0, Total=4422 [2018-10-02 11:55:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-02 11:55:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-10-02 11:55:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-02 11:55:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-02 11:55:32,600 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-10-02 11:55:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:32,600 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-02 11:55:32,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-02 11:55:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-02 11:55:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-02 11:55:32,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:32,601 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-10-02 11:55:32,601 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:32,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-10-02 11:55:32,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:32,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:32,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:32,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:32,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:33,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:33,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:33,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:33,270 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-02 11:55:33,270 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:33,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:33,291 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-10-02 11:55:33,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:33,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:33,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:33,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:33,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-02 11:55:33,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-02 11:55:33,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-02 11:55:33,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-10-02 11:55:33,932 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-10-02 11:55:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:34,803 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-02 11:55:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:55:34,803 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-10-02 11:55:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:34,804 INFO L225 Difference]: With dead ends: 121 [2018-10-02 11:55:34,804 INFO L226 Difference]: Without dead ends: 120 [2018-10-02 11:55:34,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:55:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-02 11:55:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-10-02 11:55:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-02 11:55:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-02 11:55:34,821 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-10-02 11:55:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:34,822 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-02 11:55:34,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-02 11:55:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-02 11:55:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-02 11:55:34,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:34,823 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-10-02 11:55:34,823 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:34,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-10-02 11:55:34,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:34,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:36,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:36,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:36,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:36,161 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:36,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:36,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:36,170 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-10-02 11:55:36,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:36,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-10-02 11:55:36,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:36,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:36,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-02 11:55:36,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-02 11:55:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-02 11:55:36,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:55:36,694 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-10-02 11:55:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:37,618 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-02 11:55:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:55:37,618 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-10-02 11:55:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:37,619 INFO L225 Difference]: With dead ends: 126 [2018-10-02 11:55:37,620 INFO L226 Difference]: Without dead ends: 125 [2018-10-02 11:55:37,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-10-02 11:55:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-02 11:55:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-02 11:55:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-02 11:55:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-02 11:55:37,635 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-10-02 11:55:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:37,635 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-02 11:55:37,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-02 11:55:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-02 11:55:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-02 11:55:37,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:37,636 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-10-02 11:55:37,636 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:37,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-10-02 11:55:37,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:37,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:37,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:38,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:38,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:38,366 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-02 11:55:38,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:38,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:38,374 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-10-02 11:55:38,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:38,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:38,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-02 11:55:38,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-02 11:55:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-02 11:55:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-10-02 11:55:38,902 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-10-02 11:55:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:39,920 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-02 11:55:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 11:55:39,921 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-10-02 11:55:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:39,922 INFO L225 Difference]: With dead ends: 131 [2018-10-02 11:55:39,922 INFO L226 Difference]: Without dead ends: 130 [2018-10-02 11:55:39,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-10-02 11:55:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-02 11:55:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-02 11:55:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-02 11:55:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-02 11:55:39,939 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-10-02 11:55:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:39,939 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-02 11:55:39,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-02 11:55:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-02 11:55:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-02 11:55:39,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:39,940 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-10-02 11:55:39,940 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:39,940 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-10-02 11:55:39,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:39,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:39,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:39,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:39,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:40,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:40,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:40,620 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:40,752 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-02 11:55:40,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:40,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:40,788 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-10-02 11:55:40,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:40,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-10-02 11:55:40,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:41,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:41,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-02 11:55:41,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-02 11:55:41,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-02 11:55:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-10-02 11:55:41,458 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-10-02 11:55:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:42,377 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-02 11:55:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:55:42,377 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-10-02 11:55:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:42,378 INFO L225 Difference]: With dead ends: 136 [2018-10-02 11:55:42,378 INFO L226 Difference]: Without dead ends: 135 [2018-10-02 11:55:42,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-10-02 11:55:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-02 11:55:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-10-02 11:55:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-02 11:55:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-02 11:55:42,401 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-10-02 11:55:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:42,401 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-02 11:55:42,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-02 11:55:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-02 11:55:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-02 11:55:42,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:42,402 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-10-02 11:55:42,402 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:42,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-10-02 11:55:42,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:42,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:42,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:42,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:43,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:43,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:43,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:43,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:43,160 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-10-02 11:55:43,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:43,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:43,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:44,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:44,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-02 11:55:44,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-02 11:55:44,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-02 11:55:44,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-10-02 11:55:44,455 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-10-02 11:55:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:45,498 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-02 11:55:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 11:55:45,498 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-10-02 11:55:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:45,499 INFO L225 Difference]: With dead ends: 141 [2018-10-02 11:55:45,499 INFO L226 Difference]: Without dead ends: 140 [2018-10-02 11:55:45,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:55:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-02 11:55:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-02 11:55:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-02 11:55:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-02 11:55:45,523 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-10-02 11:55:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:45,524 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-02 11:55:45,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-02 11:55:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-02 11:55:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-02 11:55:45,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:45,525 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-10-02 11:55:45,525 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:45,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-10-02 11:55:45,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:45,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:45,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:45,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:55:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:46,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:46,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:46,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:55:46,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:55:46,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:46,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:46,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-10-02 11:55:46,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:46,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:46,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:47,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-02 11:55:47,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-02 11:55:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-02 11:55:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:55:47,083 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-10-02 11:55:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:48,219 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-02 11:55:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:55:48,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-10-02 11:55:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:48,220 INFO L225 Difference]: With dead ends: 146 [2018-10-02 11:55:48,220 INFO L226 Difference]: Without dead ends: 145 [2018-10-02 11:55:48,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-10-02 11:55:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-02 11:55:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-10-02 11:55:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-02 11:55:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-02 11:55:48,247 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-10-02 11:55:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:48,247 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-02 11:55:48,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-02 11:55:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-02 11:55:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-02 11:55:48,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:48,248 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-10-02 11:55:48,249 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:48,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-10-02 11:55:48,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:48,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:48,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:48,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:48,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:48,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:48,937 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:48,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:55:49,109 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-02 11:55:49,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:49,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:49,123 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-10-02 11:55:49,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:49,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:49,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:49,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:49,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-02 11:55:49,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-02 11:55:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-02 11:55:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:55:49,779 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-10-02 11:55:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:50,947 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-02 11:55:50,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:55:50,948 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-10-02 11:55:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:50,948 INFO L225 Difference]: With dead ends: 151 [2018-10-02 11:55:50,948 INFO L226 Difference]: Without dead ends: 150 [2018-10-02 11:55:50,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-10-02 11:55:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-02 11:55:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-10-02 11:55:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-02 11:55:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-02 11:55:50,977 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-10-02 11:55:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:50,977 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-02 11:55:50,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-02 11:55:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-02 11:55:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-02 11:55:50,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:50,978 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-10-02 11:55:50,978 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:50,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-10-02 11:55:50,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:50,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:50,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:51,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:51,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:51,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:55:51,878 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:55:51,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:51,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:51,887 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-10-02 11:55:51,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:51,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:51,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:52,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-02 11:55:52,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-02 11:55:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-02 11:55:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:55:52,790 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-10-02 11:55:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:54,018 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-02 11:55:54,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-02 11:55:54,019 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-10-02 11:55:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:54,020 INFO L225 Difference]: With dead ends: 156 [2018-10-02 11:55:54,020 INFO L226 Difference]: Without dead ends: 155 [2018-10-02 11:55:54,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-10-02 11:55:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-02 11:55:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-02 11:55:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-02 11:55:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-02 11:55:54,044 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-10-02 11:55:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-02 11:55:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-02 11:55:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-02 11:55:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-02 11:55:54,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:54,045 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-10-02 11:55:54,046 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:54,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-10-02 11:55:54,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:54,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:54,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:54,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:54,781 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:54,789 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:55:54,937 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-02 11:55:54,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:54,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:54,955 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-10-02 11:55:54,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:55,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:55,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:55,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-02 11:55:55,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-02 11:55:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-02 11:55:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-10-02 11:55:55,971 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-10-02 11:55:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:55:57,448 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-02 11:55:57,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-02 11:55:57,449 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-10-02 11:55:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:55:57,450 INFO L225 Difference]: With dead ends: 161 [2018-10-02 11:55:57,450 INFO L226 Difference]: Without dead ends: 160 [2018-10-02 11:55:57,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-10-02 11:55:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-02 11:55:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-02 11:55:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-02 11:55:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-02 11:55:57,476 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-10-02 11:55:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:55:57,476 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-02 11:55:57,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-02 11:55:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-02 11:55:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-02 11:55:57,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:55:57,477 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-10-02 11:55:57,477 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:55:57,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:55:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-10-02 11:55:57,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:55:57,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:55:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:57,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:55:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:55:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:55:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:58,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:55:58,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:55:58,242 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:55:58,417 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-02 11:55:58,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:55:58,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:55:58,450 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-10-02 11:55:58,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:55:58,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:55:58,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:55:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:55:59,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:55:59,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-02 11:55:59,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-02 11:55:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-02 11:55:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-10-02 11:55:59,238 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-10-02 11:56:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:00,612 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-02 11:56:00,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-02 11:56:00,613 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-10-02 11:56:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:00,614 INFO L225 Difference]: With dead ends: 166 [2018-10-02 11:56:00,614 INFO L226 Difference]: Without dead ends: 165 [2018-10-02 11:56:00,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-10-02 11:56:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-02 11:56:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-10-02 11:56:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-02 11:56:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-02 11:56:00,640 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-10-02 11:56:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:00,640 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-02 11:56:00,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-02 11:56:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-02 11:56:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-02 11:56:00,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:00,641 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-10-02 11:56:00,642 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:00,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-10-02 11:56:00,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:00,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:00,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:01,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:01,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:01,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:01,862 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-10-02 11:56:01,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:01,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:01,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:02,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-02 11:56:02,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-02 11:56:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-02 11:56:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:56:02,698 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-10-02 11:56:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:04,555 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-02 11:56:04,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 11:56:04,555 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-10-02 11:56:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:04,557 INFO L225 Difference]: With dead ends: 171 [2018-10-02 11:56:04,557 INFO L226 Difference]: Without dead ends: 170 [2018-10-02 11:56:04,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-10-02 11:56:04,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-02 11:56:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-10-02 11:56:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-02 11:56:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-02 11:56:04,587 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-10-02 11:56:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:04,588 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-02 11:56:04,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-02 11:56:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-02 11:56:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-02 11:56:04,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:04,589 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-10-02 11:56:04,589 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:04,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-10-02 11:56:04,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:05,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:05,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:05,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:56:05,872 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:56:05,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:05,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:05,892 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-10-02 11:56:05,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:05,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:05,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:07,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:07,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-02 11:56:07,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-02 11:56:07,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-02 11:56:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-10-02 11:56:07,060 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-10-02 11:56:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:08,482 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-02 11:56:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-02 11:56:08,483 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-10-02 11:56:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:08,484 INFO L225 Difference]: With dead ends: 176 [2018-10-02 11:56:08,484 INFO L226 Difference]: Without dead ends: 175 [2018-10-02 11:56:08,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-10-02 11:56:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-02 11:56:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-10-02 11:56:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-02 11:56:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-02 11:56:08,519 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-10-02 11:56:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:08,520 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-02 11:56:08,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-02 11:56:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-02 11:56:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-02 11:56:08,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:08,521 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-10-02 11:56:08,521 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:08,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-10-02 11:56:08,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:08,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:08,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:09,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:09,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:09,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:56:10,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-02 11:56:10,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:10,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:10,064 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-10-02 11:56:10,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:10,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:10,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:10,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:10,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-02 11:56:10,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-02 11:56:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-02 11:56:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-10-02 11:56:10,945 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-10-02 11:56:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:12,934 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-02 11:56:12,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-02 11:56:12,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-10-02 11:56:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:12,936 INFO L225 Difference]: With dead ends: 181 [2018-10-02 11:56:12,936 INFO L226 Difference]: Without dead ends: 180 [2018-10-02 11:56:12,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-10-02 11:56:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-02 11:56:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-10-02 11:56:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-02 11:56:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-02 11:56:12,964 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-10-02 11:56:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:12,965 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-02 11:56:12,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-02 11:56:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-02 11:56:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-02 11:56:12,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:12,966 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-10-02 11:56:12,966 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:12,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-10-02 11:56:12,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:12,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:12,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:14,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:14,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:14,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:56:14,401 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:56:14,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:14,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:14,434 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-10-02 11:56:14,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:14,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:14,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:15,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:15,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-02 11:56:15,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-02 11:56:15,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-02 11:56:15,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:56:15,489 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-10-02 11:56:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:17,325 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-02 11:56:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:56:17,325 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-10-02 11:56:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:17,326 INFO L225 Difference]: With dead ends: 186 [2018-10-02 11:56:17,326 INFO L226 Difference]: Without dead ends: 185 [2018-10-02 11:56:17,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-10-02 11:56:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-02 11:56:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-02 11:56:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-02 11:56:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-02 11:56:17,362 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-10-02 11:56:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:17,362 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-02 11:56:17,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-02 11:56:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-02 11:56:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-02 11:56:17,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:17,363 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-10-02 11:56:17,364 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:17,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-10-02 11:56:17,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:17,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:17,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:18,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:18,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:56:18,481 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-02 11:56:18,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:18,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:18,507 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-10-02 11:56:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:18,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-10-02 11:56:18,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:19,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:19,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-02 11:56:19,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-02 11:56:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-02 11:56:19,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-10-02 11:56:19,692 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-10-02 11:56:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:21,297 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-02 11:56:21,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 11:56:21,298 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-10-02 11:56:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:21,299 INFO L225 Difference]: With dead ends: 191 [2018-10-02 11:56:21,299 INFO L226 Difference]: Without dead ends: 190 [2018-10-02 11:56:21,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-10-02 11:56:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-02 11:56:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-02 11:56:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-02 11:56:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-02 11:56:21,330 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-10-02 11:56:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:21,330 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-02 11:56:21,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-02 11:56:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-02 11:56:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-02 11:56:21,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:21,331 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-10-02 11:56:21,331 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:21,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-10-02 11:56:21,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:21,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:22,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:22,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:22,576 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:56:22,809 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-02 11:56:22,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:22,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:22,838 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-10-02 11:56:22,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:22,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:22,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:25,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:25,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-02 11:56:25,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-02 11:56:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-02 11:56:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:56:25,124 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-10-02 11:56:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:26,923 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-02 11:56:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 11:56:26,923 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-10-02 11:56:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:26,924 INFO L225 Difference]: With dead ends: 196 [2018-10-02 11:56:26,924 INFO L226 Difference]: Without dead ends: 195 [2018-10-02 11:56:26,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-10-02 11:56:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-02 11:56:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-10-02 11:56:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-02 11:56:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-02 11:56:26,967 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-10-02 11:56:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:26,968 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-02 11:56:26,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-02 11:56:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-02 11:56:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-02 11:56:26,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:26,969 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-10-02 11:56:26,969 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:26,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-10-02 11:56:26,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:26,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:26,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:28,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:28,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:28,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:28,379 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-10-02 11:56:28,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:28,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:28,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:29,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-02 11:56:29,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-02 11:56:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-02 11:56:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-10-02 11:56:29,492 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-10-02 11:56:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:31,199 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-02 11:56:31,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 11:56:31,199 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-10-02 11:56:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:31,200 INFO L225 Difference]: With dead ends: 201 [2018-10-02 11:56:31,200 INFO L226 Difference]: Without dead ends: 200 [2018-10-02 11:56:31,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-10-02 11:56:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-02 11:56:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-10-02 11:56:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-02 11:56:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-02 11:56:31,236 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-10-02 11:56:31,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:31,236 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-02 11:56:31,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-02 11:56:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-02 11:56:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-02 11:56:31,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:31,237 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-10-02 11:56:31,237 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:31,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-10-02 11:56:31,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:31,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:31,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:31,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:31,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:32,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:32,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:56:32,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:56:32,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:32,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:32,702 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-10-02 11:56:32,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:32,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-10-02 11:56:32,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:33,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:33,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-02 11:56:33,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-02 11:56:33,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-02 11:56:33,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:56:33,914 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-10-02 11:56:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:36,010 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-02 11:56:36,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 11:56:36,010 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-10-02 11:56:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:36,011 INFO L225 Difference]: With dead ends: 206 [2018-10-02 11:56:36,012 INFO L226 Difference]: Without dead ends: 205 [2018-10-02 11:56:36,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-10-02 11:56:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-02 11:56:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-10-02 11:56:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-02 11:56:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-02 11:56:36,046 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-10-02 11:56:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:36,046 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-02 11:56:36,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-02 11:56:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-02 11:56:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-02 11:56:36,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:36,047 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-10-02 11:56:36,047 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:36,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-10-02 11:56:36,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:36,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:36,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:37,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:37,416 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:56:37,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-02 11:56:37,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:37,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:37,725 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-10-02 11:56:37,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:37,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:37,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:38,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:38,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-02 11:56:38,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-02 11:56:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-02 11:56:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-10-02 11:56:38,954 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-10-02 11:56:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:40,804 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-02 11:56:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-02 11:56:40,804 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-10-02 11:56:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:40,805 INFO L225 Difference]: With dead ends: 211 [2018-10-02 11:56:40,805 INFO L226 Difference]: Without dead ends: 210 [2018-10-02 11:56:40,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-10-02 11:56:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-02 11:56:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-10-02 11:56:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-02 11:56:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-02 11:56:40,845 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-10-02 11:56:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:40,845 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-02 11:56:40,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-02 11:56:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-02 11:56:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-02 11:56:40,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:40,846 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-10-02 11:56:40,846 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:40,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-10-02 11:56:40,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:40,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:40,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:40,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:40,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:41,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:41,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:56:42,107 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:56:42,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:42,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:42,132 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-10-02 11:56:42,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:42,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:42,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:43,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-02 11:56:43,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-02 11:56:43,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-02 11:56:43,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-10-02 11:56:43,518 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-10-02 11:56:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:45,462 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-02 11:56:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-02 11:56:45,462 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-10-02 11:56:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:45,463 INFO L225 Difference]: With dead ends: 216 [2018-10-02 11:56:45,463 INFO L226 Difference]: Without dead ends: 215 [2018-10-02 11:56:45,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-10-02 11:56:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-02 11:56:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-02 11:56:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-02 11:56:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-02 11:56:45,500 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-10-02 11:56:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:45,500 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-02 11:56:45,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-02 11:56:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-02 11:56:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-02 11:56:45,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:45,501 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-10-02 11:56:45,501 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:45,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:45,501 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-10-02 11:56:45,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:45,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:45,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:45,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:45,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:46,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:46,574 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:46,581 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:56:46,823 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-02 11:56:46,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:46,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:46,850 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-10-02 11:56:46,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:46,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:46,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-02 11:56:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-02 11:56:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-02 11:56:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-10-02 11:56:48,397 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-10-02 11:56:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:50,475 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-02 11:56:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 11:56:50,475 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-10-02 11:56:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:50,476 INFO L225 Difference]: With dead ends: 221 [2018-10-02 11:56:50,476 INFO L226 Difference]: Without dead ends: 220 [2018-10-02 11:56:50,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-10-02 11:56:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-02 11:56:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-02 11:56:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-02 11:56:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-02 11:56:50,517 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-10-02 11:56:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:50,517 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-02 11:56:50,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-02 11:56:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-02 11:56:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-02 11:56:50,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:50,518 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-10-02 11:56:50,518 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-10-02 11:56:50,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:50,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:51,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:51,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:56:52,039 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-02 11:56:52,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:56:52,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:52,059 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-10-02 11:56:52,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:52,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:52,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:53,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:53,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-02 11:56:53,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-02 11:56:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-02 11:56:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-10-02 11:56:53,629 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-10-02 11:56:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:56:55,806 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-02 11:56:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 11:56:55,807 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-10-02 11:56:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:56:55,808 INFO L225 Difference]: With dead ends: 226 [2018-10-02 11:56:55,808 INFO L226 Difference]: Without dead ends: 225 [2018-10-02 11:56:55,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-10-02 11:56:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-02 11:56:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-10-02 11:56:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-02 11:56:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-02 11:56:55,849 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-10-02 11:56:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:56:55,849 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-02 11:56:55,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-02 11:56:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-02 11:56:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-02 11:56:55,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:56:55,851 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-10-02 11:56:55,851 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:56:55,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:56:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-10-02 11:56:55,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:56:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:56:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:55,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:56:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:56:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:57,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:56:57,036 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:56:57,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:56:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:56:57,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:56:57,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-10-02 11:56:57,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:56:57,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:56:57,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:56:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:56:59,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:56:59,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-02 11:56:59,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-02 11:56:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-02 11:56:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-10-02 11:56:59,426 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-10-02 11:57:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:01,668 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-02 11:57:01,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-02 11:57:01,668 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-10-02 11:57:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:01,669 INFO L225 Difference]: With dead ends: 231 [2018-10-02 11:57:01,670 INFO L226 Difference]: Without dead ends: 230 [2018-10-02 11:57:01,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-10-02 11:57:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-02 11:57:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-02 11:57:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-02 11:57:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-02 11:57:01,726 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-10-02 11:57:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:01,726 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-02 11:57:01,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-02 11:57:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-02 11:57:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-02 11:57:01,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:01,728 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-10-02 11:57:01,728 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:01,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-10-02 11:57:01,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:03,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:03,298 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:03,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:03,456 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:03,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:03,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:03,465 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-10-02 11:57:03,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:03,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:03,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:04,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:04,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-02 11:57:04,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-02 11:57:04,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-02 11:57:04,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-10-02 11:57:04,965 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-10-02 11:57:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:07,253 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-02 11:57:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-02 11:57:07,253 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-10-02 11:57:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:07,254 INFO L225 Difference]: With dead ends: 236 [2018-10-02 11:57:07,254 INFO L226 Difference]: Without dead ends: 235 [2018-10-02 11:57:07,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6485, Invalid=12697, Unknown=0, NotChecked=0, Total=19182 [2018-10-02 11:57:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-02 11:57:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-10-02 11:57:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-02 11:57:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-02 11:57:07,311 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-10-02 11:57:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:07,311 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-02 11:57:07,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-02 11:57:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-02 11:57:07,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-02 11:57:07,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:07,312 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-10-02 11:57:07,313 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:07,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:07,313 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-10-02 11:57:07,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:07,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:08,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:08,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:08,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:09,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-02 11:57:09,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:09,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:09,306 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-10-02 11:57:09,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:09,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:09,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:11,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-02 11:57:11,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-02 11:57:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-02 11:57:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-10-02 11:57:11,032 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-10-02 11:57:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:13,553 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-02 11:57:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 11:57:13,554 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-10-02 11:57:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:13,555 INFO L225 Difference]: With dead ends: 241 [2018-10-02 11:57:13,555 INFO L226 Difference]: Without dead ends: 240 [2018-10-02 11:57:13,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-10-02 11:57:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-02 11:57:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-10-02 11:57:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-02 11:57:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-02 11:57:13,614 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-10-02 11:57:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:13,615 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-02 11:57:13,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-02 11:57:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-02 11:57:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-02 11:57:13,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:13,616 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-10-02 11:57:13,617 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:13,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-10-02 11:57:13,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:13,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:13,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:13,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:13,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:15,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:15,013 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:15,181 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:15,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:15,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:15,207 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-10-02 11:57:15,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:15,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:15,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:16,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-02 11:57:16,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-02 11:57:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-02 11:57:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-10-02 11:57:16,796 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-10-02 11:57:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:19,442 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-02 11:57:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 11:57:19,443 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-10-02 11:57:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:19,444 INFO L225 Difference]: With dead ends: 246 [2018-10-02 11:57:19,444 INFO L226 Difference]: Without dead ends: 245 [2018-10-02 11:57:19,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-10-02 11:57:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-02 11:57:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-02 11:57:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-02 11:57:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-02 11:57:19,497 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-10-02 11:57:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:19,498 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-02 11:57:19,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-02 11:57:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-02 11:57:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-02 11:57:19,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:19,499 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-10-02 11:57:19,500 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:19,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-10-02 11:57:19,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:19,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:19,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:21,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:21,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:57:21,432 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-02 11:57:21,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:21,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:21,448 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-10-02 11:57:21,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:21,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:21,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:23,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:23,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-02 11:57:23,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-02 11:57:23,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-02 11:57:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-10-02 11:57:23,174 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-10-02 11:57:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:25,820 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-02 11:57:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 11:57:25,820 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-10-02 11:57:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:25,821 INFO L225 Difference]: With dead ends: 251 [2018-10-02 11:57:25,821 INFO L226 Difference]: Without dead ends: 250 [2018-10-02 11:57:25,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-10-02 11:57:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-02 11:57:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-10-02 11:57:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-02 11:57:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-02 11:57:25,876 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-10-02 11:57:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:25,876 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-02 11:57:25,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-02 11:57:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-02 11:57:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-02 11:57:25,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:25,877 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-10-02 11:57:25,877 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:25,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-10-02 11:57:25,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:25,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:25,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:27,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:27,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:27,775 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:57:28,157 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-02 11:57:28,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:28,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:28,169 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-10-02 11:57:28,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:28,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:28,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:30,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:30,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-02 11:57:30,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-02 11:57:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-02 11:57:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-10-02 11:57:30,264 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-10-02 11:57:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:33,006 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-02 11:57:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-02 11:57:33,007 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-10-02 11:57:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:33,008 INFO L225 Difference]: With dead ends: 256 [2018-10-02 11:57:33,008 INFO L226 Difference]: Without dead ends: 255 [2018-10-02 11:57:33,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-10-02 11:57:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-02 11:57:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-10-02 11:57:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-02 11:57:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-02 11:57:33,066 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-10-02 11:57:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:33,066 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-02 11:57:33,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-02 11:57:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-02 11:57:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-02 11:57:33,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:33,068 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-10-02 11:57:33,068 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:33,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-10-02 11:57:33,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:33,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:33,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:34,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:34,947 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:34,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:35,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:35,143 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-10-02 11:57:35,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:35,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:35,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:37,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-02 11:57:37,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-02 11:57:37,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-02 11:57:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-10-02 11:57:37,057 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-10-02 11:57:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:40,079 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-02 11:57:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 11:57:40,080 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-10-02 11:57:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:40,081 INFO L225 Difference]: With dead ends: 261 [2018-10-02 11:57:40,081 INFO L226 Difference]: Without dead ends: 260 [2018-10-02 11:57:40,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-10-02 11:57:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-02 11:57:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-10-02 11:57:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-02 11:57:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-02 11:57:40,152 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-10-02 11:57:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:40,152 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-02 11:57:40,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-02 11:57:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-02 11:57:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-02 11:57:40,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:40,153 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-10-02 11:57:40,154 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:40,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-10-02 11:57:40,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:40,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:57:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:41,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:41,685 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:57:41,901 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:57:41,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:41,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:41,925 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-10-02 11:57:41,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:41,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:41,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:44,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:44,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-10-02 11:57:44,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-02 11:57:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-02 11:57:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-10-02 11:57:44,007 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-10-02 11:57:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:47,106 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-02 11:57:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:57:47,106 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-10-02 11:57:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:47,107 INFO L225 Difference]: With dead ends: 266 [2018-10-02 11:57:47,107 INFO L226 Difference]: Without dead ends: 265 [2018-10-02 11:57:47,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-10-02 11:57:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-02 11:57:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-10-02 11:57:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-02 11:57:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-02 11:57:47,168 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-10-02 11:57:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:47,168 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-02 11:57:47,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-02 11:57:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-02 11:57:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-02 11:57:47,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:47,169 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-10-02 11:57:47,170 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:47,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:47,170 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-10-02 11:57:47,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:47,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:47,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:47,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:47,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:48,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:48,768 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:48,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:57:49,211 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-02 11:57:49,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:49,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:49,223 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-10-02 11:57:49,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:49,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:49,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:51,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:51,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-10-02 11:57:51,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-02 11:57:51,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-02 11:57:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-10-02 11:57:51,108 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-10-02 11:57:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:57:54,245 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-02 11:57:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:57:54,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-10-02 11:57:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:57:54,246 INFO L225 Difference]: With dead ends: 271 [2018-10-02 11:57:54,246 INFO L226 Difference]: Without dead ends: 270 [2018-10-02 11:57:54,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-10-02 11:57:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-02 11:57:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-10-02 11:57:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-02 11:57:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-02 11:57:54,305 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-10-02 11:57:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:57:54,306 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-02 11:57:54,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-02 11:57:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-02 11:57:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-02 11:57:54,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:57:54,307 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-10-02 11:57:54,307 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:57:54,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:57:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-10-02 11:57:54,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:57:54,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:57:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:54,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:57:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:57:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:57:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:56,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:57:56,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:57:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:57:56,247 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:57:56,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:57:56,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:57:56,262 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-10-02 11:57:56,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:57:56,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:57:56,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:57:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:57:58,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:57:58,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-10-02 11:57:58,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-02 11:57:58,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-02 11:57:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-10-02 11:57:58,257 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-10-02 11:58:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:01,561 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-02 11:58:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-02 11:58:01,561 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-10-02 11:58:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:01,562 INFO L225 Difference]: With dead ends: 276 [2018-10-02 11:58:01,562 INFO L226 Difference]: Without dead ends: 275 [2018-10-02 11:58:01,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-10-02 11:58:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-02 11:58:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-02 11:58:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-02 11:58:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-02 11:58:01,633 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-10-02 11:58:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:01,634 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-02 11:58:01,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-02 11:58:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-02 11:58:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-02 11:58:01,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:01,635 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-10-02 11:58:01,636 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:01,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-10-02 11:58:01,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:01,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:01,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:03,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:03,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:03,453 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:58:03,815 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-02 11:58:03,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:03,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:03,828 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-10-02 11:58:03,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:03,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:03,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-10-02 11:58:06,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-02 11:58:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-02 11:58:06,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-10-02 11:58:06,131 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-10-02 11:58:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:09,496 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-02 11:58:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-02 11:58:09,496 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-10-02 11:58:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:09,497 INFO L225 Difference]: With dead ends: 281 [2018-10-02 11:58:09,497 INFO L226 Difference]: Without dead ends: 280 [2018-10-02 11:58:09,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-10-02 11:58:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-02 11:58:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-10-02 11:58:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-02 11:58:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-02 11:58:09,563 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-10-02 11:58:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:09,563 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-02 11:58:09,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-02 11:58:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-02 11:58:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-02 11:58:09,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:09,565 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-10-02 11:58:09,565 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:09,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-10-02 11:58:09,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:09,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:11,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:11,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:11,336 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:58:11,776 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-02 11:58:11,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:11,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:11,805 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-10-02 11:58:11,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:11,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:11,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:13,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-10-02 11:58:13,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-02 11:58:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-02 11:58:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-10-02 11:58:13,906 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-10-02 11:58:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:17,240 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-02 11:58:17,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-02 11:58:17,240 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-10-02 11:58:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:17,241 INFO L225 Difference]: With dead ends: 286 [2018-10-02 11:58:17,242 INFO L226 Difference]: Without dead ends: 285 [2018-10-02 11:58:17,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-10-02 11:58:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-02 11:58:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-10-02 11:58:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-02 11:58:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-02 11:58:17,305 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-10-02 11:58:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:17,305 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-02 11:58:17,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-02 11:58:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-02 11:58:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-02 11:58:17,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:17,307 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-10-02 11:58:17,307 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:17,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-10-02 11:58:17,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:17,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:17,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:17,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:19,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:19,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:19,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:58:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:19,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:19,396 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-10-02 11:58:19,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:19,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:19,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:21,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:21,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-10-02 11:58:21,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-02 11:58:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-02 11:58:21,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-10-02 11:58:21,725 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-10-02 11:58:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:25,206 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-02 11:58:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-02 11:58:25,206 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-10-02 11:58:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:25,207 INFO L225 Difference]: With dead ends: 291 [2018-10-02 11:58:25,207 INFO L226 Difference]: Without dead ends: 290 [2018-10-02 11:58:25,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-10-02 11:58:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-02 11:58:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-10-02 11:58:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-02 11:58:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-02 11:58:25,274 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-10-02 11:58:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-02 11:58:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-02 11:58:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-02 11:58:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-02 11:58:25,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:25,275 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-10-02 11:58:25,276 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:25,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-10-02 11:58:25,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:25,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:58:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:27,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:27,056 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:27,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:58:27,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:58:27,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:27,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:27,258 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-10-02 11:58:27,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:27,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:27,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:29,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-10-02 11:58:29,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-02 11:58:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-02 11:58:29,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-10-02 11:58:29,417 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-10-02 11:58:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:33,029 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-02 11:58:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-02 11:58:33,029 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-10-02 11:58:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:33,030 INFO L225 Difference]: With dead ends: 296 [2018-10-02 11:58:33,030 INFO L226 Difference]: Without dead ends: 295 [2018-10-02 11:58:33,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-10-02 11:58:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-02 11:58:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-10-02 11:58:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-02 11:58:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-02 11:58:33,105 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-10-02 11:58:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:33,105 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-02 11:58:33,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-02 11:58:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-02 11:58:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-02 11:58:33,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:33,107 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-10-02 11:58:33,107 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:33,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-10-02 11:58:33,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:33,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:35,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:35,142 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:35,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:58:35,587 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-02 11:58:35,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:35,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:35,600 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-10-02 11:58:35,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:35,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:35,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:37,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:37,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-10-02 11:58:37,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-02 11:58:37,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-02 11:58:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-10-02 11:58:37,868 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-10-02 11:58:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:41,363 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-02 11:58:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-02 11:58:41,363 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-10-02 11:58:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:41,364 INFO L225 Difference]: With dead ends: 301 [2018-10-02 11:58:41,365 INFO L226 Difference]: Without dead ends: 300 [2018-10-02 11:58:41,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-10-02 11:58:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-02 11:58:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-10-02 11:58:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-02 11:58:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-02 11:58:41,440 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-10-02 11:58:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:41,440 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-02 11:58:41,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-02 11:58:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-02 11:58:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-02 11:58:41,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:41,442 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-10-02 11:58:41,442 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:41,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-10-02 11:58:41,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:41,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:43,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:43,327 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:58:43,544 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:58:43,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:43,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:43,556 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-10-02 11:58:43,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:43,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:43,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-10-02 11:58:45,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-02 11:58:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-02 11:58:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-10-02 11:58:45,846 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-10-02 11:58:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:49,349 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-02 11:58:49,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 11:58:49,350 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-10-02 11:58:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:49,351 INFO L225 Difference]: With dead ends: 306 [2018-10-02 11:58:49,351 INFO L226 Difference]: Without dead ends: 305 [2018-10-02 11:58:49,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-10-02 11:58:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-02 11:58:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-02 11:58:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-02 11:58:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-02 11:58:49,424 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-10-02 11:58:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:49,425 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-02 11:58:49,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-02 11:58:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-02 11:58:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-02 11:58:49,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:49,426 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-10-02 11:58:49,426 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:49,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-10-02 11:58:49,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:49,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:49,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:49,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:49,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:51,406 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-02 11:58:51,839 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-02 11:58:51,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:58:51,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:58:51,853 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-10-02 11:58:51,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:58:51,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:58:51,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-02 11:58:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:54,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:58:54,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-10-02 11:58:54,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-02 11:58:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-02 11:58:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-10-02 11:58:54,214 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2018-10-02 11:58:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:58:57,864 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-02 11:58:57,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-02 11:58:57,872 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2018-10-02 11:58:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:58:57,874 INFO L225 Difference]: With dead ends: 311 [2018-10-02 11:58:57,874 INFO L226 Difference]: Without dead ends: 310 [2018-10-02 11:58:57,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11345, Invalid=22327, Unknown=0, NotChecked=0, Total=33672 [2018-10-02 11:58:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-02 11:58:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-10-02 11:58:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-02 11:58:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-02 11:58:57,950 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2018-10-02 11:58:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:58:57,950 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-02 11:58:57,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-02 11:58:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-02 11:58:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-02 11:58:57,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:58:57,951 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2018-10-02 11:58:57,952 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-02 11:58:57,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:58:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2018-10-02 11:58:57,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:58:57,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:58:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:57,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:58:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:58:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:58:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:58:59,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:58:59,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:58:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-02 11:59:00,494 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-02 11:59:00,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:59:00,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:59:00,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-02 11:59:00,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-02 11:59:00,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-02 11:59:00,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-10-02 11:59:02,123 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-02 11:59:02,323 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:59:02,324 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:59:02,330 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:59:02,331 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:59:02 BoogieIcfgContainer [2018-10-02 11:59:02,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:59:02,331 INFO L168 Benchmark]: Toolchain (without parser) took 240155.28 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -326.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-02 11:59:02,332 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-10-02 11:59:02,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.44 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-10-02 11:59:02,332 INFO L168 Benchmark]: Boogie Preprocessor took 21.29 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-10-02 11:59:02,333 INFO L168 Benchmark]: RCFGBuilder took 449.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:59:02,333 INFO L168 Benchmark]: TraceAbstraction took 239618.12 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -348.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-10-02 11:59:02,335 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.19 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 60.44 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 21.29 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 449.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239618.12 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -348.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 307 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 307 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 239.4s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 96.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 11200 SDslu, 2208 SDs, 0 SdLazy, 16368 SolverSat, 5613 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12932 GetRequests, 7320 SyntacticMatches, 0 SemanticMatches, 5612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221132 ImplicationChecksByTransitivity, 175.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=62, 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: 1.9s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 119.8s InterpolantComputationTime, 18428 NumberOfCodeBlocks, 18428 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18307 ConstructedInterpolants, 0 QuantifiedInterpolants, 29560497 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39471 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 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.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-59-02-343.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-59-02-343.csv Completed graceful shutdown