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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:06:09,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:06:09,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:06:09,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:06:09,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:06:09,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:06:09,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:06:09,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:06:09,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:06:09,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:06:09,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:06:09,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:06:09,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:06:09,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:06:09,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:06:09,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:06:09,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:06:09,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:06:09,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:06:09,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:06:09,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:06:09,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:06:09,259 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:06:09,260 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:06:09,260 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:06:09,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:06:09,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:06:09,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:06:09,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:06:09,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:06:09,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:06:09,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:06:09,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:06:09,268 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:06:09,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:06:09,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:06:09,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:06:09,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:06:09,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:06:09,301 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:06:09,301 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:06:09,302 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:06:09,302 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:06:09,303 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:06:09,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:06:09,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:06:09,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:06:09,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:06:09,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:06:09,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:06:09,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:06:09,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:06:09,306 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:06:09,306 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:06:09,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:06:09,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:06:09,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:06:09,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:06:09,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:06:09,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:09,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:06:09,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:06:09,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:06:09,309 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:06:09,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:06:09,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:06:09,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:06:09,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:06:09,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:06:09,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:06:09,411 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:06:09,412 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:06:09,413 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-09-30 20:06:09,413 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-09-30 20:06:09,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:06:09,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:06:09,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:09,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:06:09,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:06:09,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,518 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:06:09,518 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:06:09,518 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:06:09,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:09,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:06:09,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:06:09,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:06:09,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... [2018-09-30 20:06:09,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:06:09,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:06:09,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:06:09,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:06:09,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:09,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-30 20:06:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 20:06:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 20:06:09,794 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:06:09,796 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:09 BoogieIcfgContainer [2018-09-30 20:06:09,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:06:09,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:06:09,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:06:09,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:06:09,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:09" (1/2) ... [2018-09-30 20:06:09,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2f1ef and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:06:09, skipping insertion in model container [2018-09-30 20:06:09,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:09" (2/2) ... [2018-09-30 20:06:09,806 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-09-30 20:06:09,818 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:06:09,830 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:06:09,886 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:06:09,887 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:06:09,887 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:06:09,888 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:06:09,888 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:06:09,888 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:06:09,888 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:06:09,888 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:06:09,889 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:06:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-30 20:06:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 20:06:09,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:09,924 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 20:06:09,925 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:09,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-09-30 20:06:09,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:09,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:09,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:10,435 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-09-30 20:06:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:10,500 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:10,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:06:10,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:06:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:06:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:06:10,523 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-30 20:06:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:10,677 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 20:06:10,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:06:10,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-30 20:06:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:10,691 INFO L225 Difference]: With dead ends: 14 [2018-09-30 20:06:10,692 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 20:06:10,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:06:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 20:06:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-30 20:06:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 20:06:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 20:06:10,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-30 20:06:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:10,729 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 20:06:10,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:06:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 20:06:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:06:10,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:10,730 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-30 20:06:10,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:10,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-09-30 20:06:10,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:10,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:10,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:10,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:11,001 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:11,388 WARN L178 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-30 20:06:11,605 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-30 20:06:11,744 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-09-30 20:06:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:11,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:11,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:11,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:11,858 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 8 treesize of output 7 [2018-09-30 20:06:11,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:11,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:11,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:12,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:12,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:12,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:12,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:12,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:12,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-30 20:06:12,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:12,164 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-09-30 20:06:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:12,238 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 20:06:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:06:12,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-09-30 20:06:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:12,240 INFO L225 Difference]: With dead ends: 10 [2018-09-30 20:06:12,241 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 20:06:12,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 20:06:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-30 20:06:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 20:06:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 20:06:12,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-30 20:06:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:12,246 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 20:06:12,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 20:06:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:06:12,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:12,247 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-30 20:06:12,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:12,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-09-30 20:06:12,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:12,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:12,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:12,804 WARN L178 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-30 20:06:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:12,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:12,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:06:12,929 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:06:12,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:12,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:12,936 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 8 treesize of output 7 [2018-09-30 20:06:12,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:12,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:12,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:13,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:13,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:13,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:13,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:13,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:13,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 20:06:13,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:06:13,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:06:13,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:06:13,136 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-09-30 20:06:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:13,209 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 20:06:13,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:06:13,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-09-30 20:06:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:13,210 INFO L225 Difference]: With dead ends: 12 [2018-09-30 20:06:13,211 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:06:13,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-30 20:06:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:06:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-30 20:06:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 20:06:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 20:06:13,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-30 20:06:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:13,216 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 20:06:13,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:06:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 20:06:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:13,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:13,217 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-30 20:06:13,217 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:13,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-09-30 20:06:13,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:13,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:13,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:13,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:13,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:13,612 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-30 20:06:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:13,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:13,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:06:13,692 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 20:06:13,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:13,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:13,714 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 8 treesize of output 7 [2018-09-30 20:06:13,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:13,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:13,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:13,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:13,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:13,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:13,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:13,949 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:13,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 20:06:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:06:13,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:06:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:06:13,951 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-09-30 20:06:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:14,079 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 20:06:14,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:06:14,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-09-30 20:06:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:14,081 INFO L225 Difference]: With dead ends: 14 [2018-09-30 20:06:14,081 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 20:06:14,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:06:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 20:06:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-09-30 20:06:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 20:06:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 20:06:14,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-30 20:06:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:14,085 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 20:06:14,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:06:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 20:06:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:06:14,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:14,086 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-30 20:06:14,086 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:14,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-09-30 20:06:14,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:14,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:14,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:14,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:14,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:14,463 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-30 20:06:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:14,549 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:14,550 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:06:14,600 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:06:14,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:14,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:14,622 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 8 treesize of output 7 [2018-09-30 20:06:14,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:14,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:14,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:14,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:14,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:14,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:14,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:14,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:14,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:06:14,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:06:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:06:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:06:14,968 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-09-30 20:06:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:15,126 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-30 20:06:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:06:15,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-09-30 20:06:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:15,127 INFO L225 Difference]: With dead ends: 16 [2018-09-30 20:06:15,128 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 20:06:15,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:06:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 20:06:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-30 20:06:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 20:06:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-30 20:06:15,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-30 20:06:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:15,133 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-30 20:06:15,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:06:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-30 20:06:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:06:15,134 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:15,134 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-30 20:06:15,135 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:15,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:15,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-09-30 20:06:15,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:15,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:15,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:15,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:15,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:15,475 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:15,475 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:06:15,499 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 20:06:15,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:15,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:15,514 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 8 treesize of output 7 [2018-09-30 20:06:15,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:15,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:15,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:15,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:15,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:15,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:15,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:15,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:15,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 20:06:15,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:06:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:06:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:06:15,847 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-09-30 20:06:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:16,005 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-30 20:06:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:06:16,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-09-30 20:06:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:16,008 INFO L225 Difference]: With dead ends: 18 [2018-09-30 20:06:16,009 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 20:06:16,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:06:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 20:06:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-09-30 20:06:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 20:06:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-30 20:06:16,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-30 20:06:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:16,015 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-30 20:06:16,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:06:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-30 20:06:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:06:16,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:16,016 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-30 20:06:16,016 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:16,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-09-30 20:06:16,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:16,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:16,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:16,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:16,357 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:16,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:16,366 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:06:16,376 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 20:06:16,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:16,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:16,384 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 8 treesize of output 7 [2018-09-30 20:06:16,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:16,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:16,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:16,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:16,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:16,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:16,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:16,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:16,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 20:06:16,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 20:06:16,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 20:06:16,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:16,661 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-09-30 20:06:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:16,912 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-30 20:06:16,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:06:16,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-09-30 20:06:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:16,915 INFO L225 Difference]: With dead ends: 20 [2018-09-30 20:06:16,915 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 20:06:16,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 20:06:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-30 20:06:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-30 20:06:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-30 20:06:16,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-30 20:06:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:16,920 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-30 20:06:16,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 20:06:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-30 20:06:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:06:16,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:16,921 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-30 20:06:16,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:16,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-09-30 20:06:16,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:16,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:17,174 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:17,734 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:17,734 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:17,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:17,786 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 8 treesize of output 7 [2018-09-30 20:06:17,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:17,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:17,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:17,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:17,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:17,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:17,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:18,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:18,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 20:06:18,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 20:06:18,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 20:06:18,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:06:18,039 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-09-30 20:06:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:18,448 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-30 20:06:18,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:06:18,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-09-30 20:06:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:18,450 INFO L225 Difference]: With dead ends: 22 [2018-09-30 20:06:18,450 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 20:06:18,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:06:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 20:06:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-30 20:06:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-30 20:06:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-30 20:06:18,456 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-30 20:06:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:18,456 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-30 20:06:18,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 20:06:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-30 20:06:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 20:06:18,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:18,457 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-09-30 20:06:18,457 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:18,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:18,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-09-30 20:06:18,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:18,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:18,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:18,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:18,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:18,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:18,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:18,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:06:18,901 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:06:18,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:18,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:18,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:06:18,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:18,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:18,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:19,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:19,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:19,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:19,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:19,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:19,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 20:06:19,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 20:06:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 20:06:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:06:19,394 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-09-30 20:06:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:19,759 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-30 20:06:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:06:19,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-09-30 20:06:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:19,761 INFO L225 Difference]: With dead ends: 24 [2018-09-30 20:06:19,761 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 20:06:19,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:06:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 20:06:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-30 20:06:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 20:06:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-30 20:06:19,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-30 20:06:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:19,767 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-30 20:06:19,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 20:06:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-30 20:06:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 20:06:19,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:19,769 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-09-30 20:06:19,769 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:19,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-09-30 20:06:19,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:19,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:19,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:19,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:20,180 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:20,180 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:06:20,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 20:06:20,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:20,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:20,213 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 8 treesize of output 7 [2018-09-30 20:06:20,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:20,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:20,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:20,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:20,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:20,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:20,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:20,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:20,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-30 20:06:20,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-30 20:06:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-30 20:06:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-30 20:06:20,517 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-09-30 20:06:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:20,851 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-30 20:06:20,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:06:20,852 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-09-30 20:06:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:20,853 INFO L225 Difference]: With dead ends: 26 [2018-09-30 20:06:20,853 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 20:06:20,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-30 20:06:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 20:06:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-30 20:06:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 20:06:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-30 20:06:20,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-30 20:06:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:20,859 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-30 20:06:20,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-30 20:06:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-30 20:06:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 20:06:20,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:20,860 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-09-30 20:06:20,861 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:20,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-09-30 20:06:20,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:20,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:20,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:20,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:20,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:21,142 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:21,468 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:21,468 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:21,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:06:21,489 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:06:21,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:21,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:21,496 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 8 treesize of output 7 [2018-09-30 20:06:21,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:21,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:21,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:21,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:21,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:21,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:21,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:21,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:21,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-30 20:06:21,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-30 20:06:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-30 20:06:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-30 20:06:21,864 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-09-30 20:06:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:22,180 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-30 20:06:22,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:06:22,181 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-09-30 20:06:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:22,182 INFO L225 Difference]: With dead ends: 28 [2018-09-30 20:06:22,182 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 20:06:22,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-30 20:06:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 20:06:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-30 20:06:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 20:06:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-30 20:06:22,188 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-30 20:06:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:22,189 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-30 20:06:22,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-30 20:06:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-30 20:06:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 20:06:22,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:22,190 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-09-30 20:06:22,190 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:22,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:22,190 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-09-30 20:06:22,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:22,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:22,502 WARN L178 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:22,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:22,966 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:22,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:06:23,045 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 20:06:23,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:23,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:23,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:06:23,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:23,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:23,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:23,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:23,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:23,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:23,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:23,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:23,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-30 20:06:23,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-30 20:06:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-30 20:06:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:23,572 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-09-30 20:06:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:24,135 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-30 20:06:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:06:24,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-09-30 20:06:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:24,137 INFO L225 Difference]: With dead ends: 30 [2018-09-30 20:06:24,137 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 20:06:24,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 20:06:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-09-30 20:06:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-30 20:06:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-30 20:06:24,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-09-30 20:06:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:24,142 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-30 20:06:24,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-30 20:06:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-30 20:06:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-30 20:06:24,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:24,143 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-09-30 20:06:24,143 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:24,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-09-30 20:06:24,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:24,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:24,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:24,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:24,815 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:06:24,864 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 20:06:24,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:24,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:24,876 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 8 treesize of output 7 [2018-09-30 20:06:24,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:24,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:24,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:25,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:25,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:25,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:25,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:25,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:25,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-30 20:06:25,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 20:06:25,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 20:06:25,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:06:25,284 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-09-30 20:06:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:25,845 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-30 20:06:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:06:25,846 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-09-30 20:06:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:25,847 INFO L225 Difference]: With dead ends: 32 [2018-09-30 20:06:25,847 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 20:06:25,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:06:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 20:06:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-30 20:06:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:06:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-30 20:06:25,853 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-09-30 20:06:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:25,853 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-30 20:06:25,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 20:06:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-30 20:06:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-30 20:06:25,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:25,854 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-09-30 20:06:25,855 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:25,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-09-30 20:06:25,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:26,476 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:26,476 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:26,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:26,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:26,501 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 8 treesize of output 7 [2018-09-30 20:06:26,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:26,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:26,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:26,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:26,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:26,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:26,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:26,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:26,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-30 20:06:26,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-30 20:06:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-30 20:06:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 20:06:26,975 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-09-30 20:06:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:27,845 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-30 20:06:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:06:27,846 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-09-30 20:06:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:27,847 INFO L225 Difference]: With dead ends: 34 [2018-09-30 20:06:27,848 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 20:06:27,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 20:06:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 20:06:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-09-30 20:06:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-30 20:06:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-30 20:06:27,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-09-30 20:06:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:27,856 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-30 20:06:27,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-30 20:06:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-30 20:06:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 20:06:27,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:27,858 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-09-30 20:06:27,858 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:27,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-09-30 20:06:27,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:27,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:28,108 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:28,726 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:28,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:28,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:06:28,762 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:06:28,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:28,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:28,772 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 8 treesize of output 7 [2018-09-30 20:06:28,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:28,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:28,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:29,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:29,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:29,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:29,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:29,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:29,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-30 20:06:29,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 20:06:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 20:06:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:06:29,284 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-09-30 20:06:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:29,786 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-30 20:06:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:06:29,787 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-09-30 20:06:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:29,788 INFO L225 Difference]: With dead ends: 36 [2018-09-30 20:06:29,789 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 20:06:29,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:06:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 20:06:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-30 20:06:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 20:06:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-30 20:06:29,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-09-30 20:06:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:29,795 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-30 20:06:29,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 20:06:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-30 20:06:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 20:06:29,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:29,796 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-09-30 20:06:29,796 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:29,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-09-30 20:06:29,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:29,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:30,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:30,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:06:30,352 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 20:06:30,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:30,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:30,366 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 8 treesize of output 7 [2018-09-30 20:06:30,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:30,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:30,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:31,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:31,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:31,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:31,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:31,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:31,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-30 20:06:31,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-30 20:06:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-30 20:06:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 20:06:31,093 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-09-30 20:06:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:31,807 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-30 20:06:31,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:06:31,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-09-30 20:06:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:31,808 INFO L225 Difference]: With dead ends: 38 [2018-09-30 20:06:31,809 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 20:06:31,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 20:06:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 20:06:31,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-30 20:06:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 20:06:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-30 20:06:31,814 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-09-30 20:06:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:31,815 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-30 20:06:31,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-30 20:06:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-30 20:06:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-30 20:06:31,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:31,816 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-09-30 20:06:31,816 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:31,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-09-30 20:06:31,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:31,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:31,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:31,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:32,071 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:32,313 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 20:06:32,575 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:33,204 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:33,204 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:33,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:06:33,222 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:06:33,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:33,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:33,227 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 8 treesize of output 7 [2018-09-30 20:06:33,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:33,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:33,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:33,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:33,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:33,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:33,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:33,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-30 20:06:33,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-30 20:06:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-30 20:06:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-30 20:06:33,930 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-09-30 20:06:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:34,719 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-30 20:06:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:06:34,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-09-30 20:06:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:34,720 INFO L225 Difference]: With dead ends: 40 [2018-09-30 20:06:34,720 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 20:06:34,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-30 20:06:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 20:06:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-30 20:06:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-30 20:06:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-30 20:06:34,729 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-30 20:06:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:34,729 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-30 20:06:34,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-30 20:06:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-30 20:06:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-30 20:06:34,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:34,730 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-09-30 20:06:34,731 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:34,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-09-30 20:06:34,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:34,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:34,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:35,023 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:35,292 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:35,577 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:36,335 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:36,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:06:36,365 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 20:06:36,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:36,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:36,370 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 8 treesize of output 7 [2018-09-30 20:06:36,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:36,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:36,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:36,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:36,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:36,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:36,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:36,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:36,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-30 20:06:36,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 20:06:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 20:06:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 20:06:36,980 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-09-30 20:06:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:37,910 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-30 20:06:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:06:37,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-09-30 20:06:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:37,911 INFO L225 Difference]: With dead ends: 42 [2018-09-30 20:06:37,911 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 20:06:37,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 20:06:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 20:06:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-09-30 20:06:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-30 20:06:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-30 20:06:37,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-09-30 20:06:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:37,916 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-30 20:06:37,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 20:06:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-30 20:06:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 20:06:37,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:37,917 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-09-30 20:06:37,917 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:37,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-09-30 20:06:37,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:37,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:38,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:38,640 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:06:38,670 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 20:06:38,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:38,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:38,681 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 8 treesize of output 7 [2018-09-30 20:06:38,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:38,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:38,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:39,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:39,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:39,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:39,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:39,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:39,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-30 20:06:39,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-30 20:06:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-30 20:06:39,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 20:06:39,653 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-09-30 20:06:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:40,572 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-30 20:06:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:06:40,573 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-09-30 20:06:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:40,574 INFO L225 Difference]: With dead ends: 44 [2018-09-30 20:06:40,574 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 20:06:40,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 20:06:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 20:06:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-09-30 20:06:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-30 20:06:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-30 20:06:40,580 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-09-30 20:06:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:40,580 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-30 20:06:40,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-30 20:06:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-30 20:06:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 20:06:40,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:40,581 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-09-30 20:06:40,581 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:40,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-09-30 20:06:40,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:40,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:41,284 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:41,284 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:41,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:41,310 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 8 treesize of output 7 [2018-09-30 20:06:41,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:41,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:41,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:42,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:42,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:42,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:42,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:42,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:42,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-30 20:06:42,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-30 20:06:42,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-30 20:06:42,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-30 20:06:42,180 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-09-30 20:06:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:43,189 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-30 20:06:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:06:43,189 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-09-30 20:06:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:43,190 INFO L225 Difference]: With dead ends: 46 [2018-09-30 20:06:43,190 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 20:06:43,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-30 20:06:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 20:06:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-09-30 20:06:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-30 20:06:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-30 20:06:43,197 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-09-30 20:06:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:43,197 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-30 20:06:43,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-30 20:06:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-30 20:06:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 20:06:43,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:43,198 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-09-30 20:06:43,198 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:43,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:43,199 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-09-30 20:06:43,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:43,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:43,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:44,018 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:44,018 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:06:44,040 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:06:44,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:44,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:44,046 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 8 treesize of output 7 [2018-09-30 20:06:44,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:44,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:44,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:44,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:44,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:44,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:44,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:44,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:44,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-30 20:06:44,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 20:06:44,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 20:06:44,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 20:06:44,966 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-09-30 20:06:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:46,119 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-30 20:06:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:06:46,120 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-09-30 20:06:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:46,120 INFO L225 Difference]: With dead ends: 48 [2018-09-30 20:06:46,121 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 20:06:46,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 20:06:46,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 20:06:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-09-30 20:06:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-30 20:06:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-30 20:06:46,127 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-09-30 20:06:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:46,128 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-30 20:06:46,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 20:06:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-30 20:06:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:06:46,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:46,131 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-09-30 20:06:46,132 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:46,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-09-30 20:06:46,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:46,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:46,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:46,327 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:47,181 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-30 20:06:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:47,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:47,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:47,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:06:47,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 20:06:47,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:47,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:47,368 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 8 treesize of output 7 [2018-09-30 20:06:47,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:47,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:47,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:48,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:48,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:48,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:48,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:48,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:48,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-30 20:06:48,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-30 20:06:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-30 20:06:48,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 20:06:48,655 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-09-30 20:06:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:50,045 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-30 20:06:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:06:50,048 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-09-30 20:06:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:50,049 INFO L225 Difference]: With dead ends: 50 [2018-09-30 20:06:50,049 INFO L226 Difference]: Without dead ends: 49 [2018-09-30 20:06:50,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 20:06:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-30 20:06:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-30 20:06:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-30 20:06:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-30 20:06:50,055 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-09-30 20:06:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:50,055 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-30 20:06:50,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-30 20:06:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-30 20:06:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 20:06:50,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:50,056 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-09-30 20:06:50,056 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:50,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-09-30 20:06:50,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:50,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:50,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:50,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:50,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:50,334 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:50,580 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:06:50,850 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:51,164 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:51,423 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:52,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:52,358 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:52,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:06:52,381 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:06:52,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:52,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:52,386 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 8 treesize of output 7 [2018-09-30 20:06:52,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:52,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:52,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:53,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:53,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:53,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:53,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:53,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:53,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-30 20:06:53,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-30 20:06:53,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-30 20:06:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-30 20:06:53,565 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-09-30 20:06:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:55,032 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-30 20:06:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:06:55,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-09-30 20:06:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:55,034 INFO L225 Difference]: With dead ends: 52 [2018-09-30 20:06:55,034 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 20:06:55,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-30 20:06:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 20:06:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-30 20:06:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 20:06:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-30 20:06:55,040 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-09-30 20:06:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:55,040 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-30 20:06:55,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-30 20:06:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-30 20:06:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 20:06:55,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:55,041 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-09-30 20:06:55,042 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:55,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-09-30 20:06:55,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:55,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:55,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:55,216 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 20:06:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:55,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:55,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:55,992 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:06:56,016 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 20:06:56,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:56,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:56,022 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 8 treesize of output 7 [2018-09-30 20:06:56,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:56,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:56,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:06:56,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:06:56,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:56,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:56,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:06:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:57,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:57,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-30 20:06:57,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-30 20:06:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-30 20:06:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 20:06:57,038 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-09-30 20:06:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:58,367 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-30 20:06:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:06:58,367 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-09-30 20:06:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:58,367 INFO L225 Difference]: With dead ends: 54 [2018-09-30 20:06:58,367 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 20:06:58,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 20:06:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 20:06:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-30 20:06:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:06:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-30 20:06:58,374 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-09-30 20:06:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:58,374 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-30 20:06:58,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-30 20:06:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-30 20:06:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 20:06:58,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:58,375 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-09-30 20:06:58,375 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:58,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:58,376 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-09-30 20:06:58,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:58,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:58,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:58,637 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:59,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:59,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:06:59,588 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:06:59,619 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 20:06:59,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:06:59,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:59,624 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 8 treesize of output 7 [2018-09-30 20:06:59,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:06:59,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:06:59,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:00,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:00,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:00,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:00,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:00,677 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:00,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-30 20:07:00,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-30 20:07:00,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-30 20:07:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-30 20:07:00,679 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-09-30 20:07:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:01,873 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-30 20:07:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:07:01,877 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-09-30 20:07:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:01,877 INFO L225 Difference]: With dead ends: 56 [2018-09-30 20:07:01,877 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 20:07:01,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-30 20:07:01,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 20:07:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-09-30 20:07:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-30 20:07:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-30 20:07:01,883 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-09-30 20:07:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:01,883 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-30 20:07:01,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-30 20:07:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-30 20:07:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-30 20:07:01,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:01,884 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-09-30 20:07:01,884 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:01,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-09-30 20:07:01,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:01,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:02,117 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:07:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:03,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:03,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:03,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:03,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:03,111 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 8 treesize of output 7 [2018-09-30 20:07:03,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:03,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:03,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:04,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:04,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:04,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:04,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:04,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:04,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-30 20:07:04,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-30 20:07:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-30 20:07:04,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-30 20:07:04,556 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-09-30 20:07:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:05,758 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-30 20:07:05,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:07:05,758 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-09-30 20:07:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:05,759 INFO L225 Difference]: With dead ends: 58 [2018-09-30 20:07:05,759 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 20:07:05,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-30 20:07:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 20:07:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-09-30 20:07:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-30 20:07:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-30 20:07:05,766 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-09-30 20:07:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:05,766 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-30 20:07:05,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-30 20:07:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-30 20:07:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-30 20:07:05,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:05,767 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-09-30 20:07:05,767 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:05,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-09-30 20:07:05,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:05,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:06,031 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:07:06,269 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:07:06,519 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:07:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:07,524 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:07,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:07,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:07:07,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:07:07,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:07,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:07,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:07:07,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:07,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:07,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:08,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:08,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:08,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:08,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:09,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:09,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-30 20:07:09,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-30 20:07:09,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-30 20:07:09,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 20:07:09,052 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-09-30 20:07:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:10,330 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-30 20:07:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:07:10,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-09-30 20:07:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:10,332 INFO L225 Difference]: With dead ends: 60 [2018-09-30 20:07:10,332 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 20:07:10,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 20:07:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 20:07:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-09-30 20:07:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-30 20:07:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-30 20:07:10,336 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-09-30 20:07:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:10,336 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-30 20:07:10,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-30 20:07:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-30 20:07:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-30 20:07:10,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:10,337 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-09-30 20:07:10,337 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:10,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-09-30 20:07:10,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:10,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:11,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:11,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:11,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:07:11,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 20:07:11,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:11,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:11,545 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 8 treesize of output 7 [2018-09-30 20:07:11,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:11,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:11,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:12,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:12,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:12,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:12,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:12,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:12,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-30 20:07:12,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-30 20:07:12,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-30 20:07:12,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 20:07:12,843 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-09-30 20:07:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:14,455 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-30 20:07:14,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:07:14,455 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-09-30 20:07:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:14,456 INFO L225 Difference]: With dead ends: 62 [2018-09-30 20:07:14,456 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 20:07:14,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 20:07:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 20:07:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-09-30 20:07:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-30 20:07:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-30 20:07:14,461 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-09-30 20:07:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:14,462 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-30 20:07:14,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-30 20:07:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-30 20:07:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-30 20:07:14,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:14,463 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-09-30 20:07:14,463 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:14,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-09-30 20:07:14,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:14,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:14,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:14,645 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:07:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:15,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:15,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:07:15,627 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:07:15,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:15,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:15,632 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 8 treesize of output 7 [2018-09-30 20:07:15,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:15,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:15,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:16,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:16,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:16,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:16,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:17,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:17,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-30 20:07:17,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-30 20:07:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-30 20:07:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 20:07:17,029 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-09-30 20:07:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:18,966 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-30 20:07:18,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:07:18,967 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-09-30 20:07:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:18,967 INFO L225 Difference]: With dead ends: 64 [2018-09-30 20:07:18,968 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 20:07:18,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 20:07:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 20:07:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-30 20:07:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-30 20:07:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-30 20:07:18,972 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-09-30 20:07:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:18,972 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-30 20:07:18,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-30 20:07:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-30 20:07:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 20:07:18,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:18,973 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-09-30 20:07:18,974 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:18,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-09-30 20:07:18,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:18,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:18,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:20,113 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:20,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:20,122 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:07:20,153 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 20:07:20,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:20,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:20,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:07:20,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:20,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:20,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:21,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:21,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:21,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:21,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:21,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:21,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-30 20:07:21,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-30 20:07:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-30 20:07:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 20:07:21,637 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-09-30 20:07:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:24,178 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-30 20:07:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:07:24,178 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-09-30 20:07:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:24,179 INFO L225 Difference]: With dead ends: 66 [2018-09-30 20:07:24,179 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 20:07:24,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 20:07:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 20:07:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-30 20:07:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 20:07:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-30 20:07:24,184 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-09-30 20:07:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:24,185 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-30 20:07:24,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-30 20:07:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-30 20:07:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-30 20:07:24,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:24,186 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-09-30 20:07:24,186 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:24,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-09-30 20:07:24,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:24,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:24,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:24,452 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:07:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:25,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:25,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:07:25,715 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 20:07:25,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:25,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:25,737 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 8 treesize of output 7 [2018-09-30 20:07:25,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:25,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:25,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:27,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:27,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:27,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:27,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:27,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:27,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-30 20:07:27,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-30 20:07:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-30 20:07:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-30 20:07:27,279 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-09-30 20:07:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:29,151 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-30 20:07:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 20:07:29,151 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-09-30 20:07:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:29,152 INFO L225 Difference]: With dead ends: 68 [2018-09-30 20:07:29,152 INFO L226 Difference]: Without dead ends: 67 [2018-09-30 20:07:29,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-30 20:07:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-30 20:07:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-30 20:07:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-30 20:07:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-30 20:07:29,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-09-30 20:07:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:29,158 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-30 20:07:29,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-30 20:07:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-30 20:07:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 20:07:29,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:29,158 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-09-30 20:07:29,159 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:29,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-09-30 20:07:29,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:29,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:30,407 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:30,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:30,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:30,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:07:30,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:30,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:30,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:32,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:32,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:32,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:32,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:32,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:32,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-30 20:07:32,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-30 20:07:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-30 20:07:32,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-30 20:07:32,098 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-09-30 20:07:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:34,897 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-30 20:07:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 20:07:34,898 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-09-30 20:07:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:34,899 INFO L225 Difference]: With dead ends: 70 [2018-09-30 20:07:34,899 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 20:07:34,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-30 20:07:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 20:07:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-09-30 20:07:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-30 20:07:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-30 20:07:34,905 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-09-30 20:07:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:34,905 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-30 20:07:34,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-30 20:07:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-30 20:07:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 20:07:34,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:34,906 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-09-30 20:07:34,906 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:34,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:34,907 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-09-30 20:07:34,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:34,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:35,078 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:07:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:36,240 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:36,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:36,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:07:36,268 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:07:36,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:36,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:36,274 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 8 treesize of output 7 [2018-09-30 20:07:36,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:36,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:36,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:39,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:39,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:39,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:39,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:39,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:39,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-30 20:07:39,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-30 20:07:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-30 20:07:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-30 20:07:39,899 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-09-30 20:07:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:42,286 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-30 20:07:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:07:42,286 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-09-30 20:07:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:42,287 INFO L225 Difference]: With dead ends: 72 [2018-09-30 20:07:42,288 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 20:07:42,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-30 20:07:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 20:07:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-09-30 20:07:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-30 20:07:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-30 20:07:42,292 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-09-30 20:07:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:42,292 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-30 20:07:42,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-30 20:07:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-30 20:07:42,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-30 20:07:42,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:42,293 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-09-30 20:07:42,293 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:42,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:42,294 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-09-30 20:07:42,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:42,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:42,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:42,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:42,553 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:07:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:43,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:43,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:43,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:07:43,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 20:07:43,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:43,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:43,886 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 8 treesize of output 7 [2018-09-30 20:07:43,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:43,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:43,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:45,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:45,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:45,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:45,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:45,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:45,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-30 20:07:45,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-30 20:07:45,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-30 20:07:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 20:07:45,997 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-09-30 20:07:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:48,052 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-30 20:07:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:07:48,053 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-09-30 20:07:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:48,054 INFO L225 Difference]: With dead ends: 74 [2018-09-30 20:07:48,054 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 20:07:48,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 20:07:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 20:07:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-09-30 20:07:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-30 20:07:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-30 20:07:48,058 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-09-30 20:07:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:48,059 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-30 20:07:48,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-30 20:07:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-30 20:07:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 20:07:48,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:48,060 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-09-30 20:07:48,060 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:48,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-09-30 20:07:48,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:48,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:48,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:48,263 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:07:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:49,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:49,817 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:07:49,845 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:07:49,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:49,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:49,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 8 treesize of output 7 [2018-09-30 20:07:49,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:49,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:49,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:51,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:51,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:51,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:51,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:51,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:51,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-30 20:07:51,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-30 20:07:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-30 20:07:51,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 20:07:51,765 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-09-30 20:07:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:54,194 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-30 20:07:54,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 20:07:54,195 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-09-30 20:07:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:54,196 INFO L225 Difference]: With dead ends: 76 [2018-09-30 20:07:54,196 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 20:07:54,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 20:07:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 20:07:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-30 20:07:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 20:07:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-30 20:07:54,201 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-09-30 20:07:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:54,201 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-30 20:07:54,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-30 20:07:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-30 20:07:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-30 20:07:54,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:54,202 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-09-30 20:07:54,202 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:54,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-09-30 20:07:54,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:54,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:07:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:55,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:55,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:55,939 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:07:56,237 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 20:07:56,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:07:56,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:56,246 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 8 treesize of output 7 [2018-09-30 20:07:56,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:56,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:56,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:07:58,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:07:58,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:07:58,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:07:58,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:07:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:58,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:58,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-30 20:07:58,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-30 20:07:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-30 20:07:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-30 20:07:58,245 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-09-30 20:08:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:01,121 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-30 20:08:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:08:01,122 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-09-30 20:08:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:01,123 INFO L225 Difference]: With dead ends: 78 [2018-09-30 20:08:01,123 INFO L226 Difference]: Without dead ends: 77 [2018-09-30 20:08:01,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-30 20:08:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-30 20:08:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-09-30 20:08:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 20:08:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-30 20:08:01,127 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-09-30 20:08:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:01,128 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-30 20:08:01,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-30 20:08:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-30 20:08:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 20:08:01,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:01,129 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-09-30 20:08:01,129 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:01,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:01,129 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-09-30 20:08:01,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:01,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:01,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:01,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:01,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:01,354 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:08:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:02,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:02,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:02,814 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:08:02,863 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 20:08:02,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:08:02,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:02,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:08:02,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:02,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:02,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:05,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:05,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:05,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:05,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:05,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:05,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-30 20:08:05,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-30 20:08:05,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-30 20:08:05,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 20:08:05,294 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-09-30 20:08:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:07,796 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-30 20:08:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:08:07,797 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-09-30 20:08:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:07,798 INFO L225 Difference]: With dead ends: 80 [2018-09-30 20:08:07,798 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 20:08:07,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 20:08:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 20:08:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-09-30 20:08:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-30 20:08:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-30 20:08:07,802 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-09-30 20:08:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:07,803 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-30 20:08:07,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-30 20:08:07,803 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-30 20:08:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-30 20:08:07,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:07,803 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-09-30 20:08:07,804 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:07,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-09-30 20:08:07,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:07,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:07,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:07,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:07,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:09,465 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:09,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:09,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:09,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:09,513 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 8 treesize of output 7 [2018-09-30 20:08:09,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:09,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:09,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:11,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:11,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:11,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:11,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:12,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:12,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-30 20:08:12,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-30 20:08:12,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-30 20:08:12,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-30 20:08:12,051 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-09-30 20:08:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:14,834 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-30 20:08:14,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 20:08:14,835 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-09-30 20:08:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:14,836 INFO L225 Difference]: With dead ends: 82 [2018-09-30 20:08:14,836 INFO L226 Difference]: Without dead ends: 81 [2018-09-30 20:08:14,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-30 20:08:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-30 20:08:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-09-30 20:08:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 20:08:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-30 20:08:14,841 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-09-30 20:08:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:14,841 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-30 20:08:14,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-30 20:08:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-30 20:08:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-30 20:08:14,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:14,842 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-09-30 20:08:14,842 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:14,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-09-30 20:08:14,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:14,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:14,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:16,623 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:16,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:16,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:08:16,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:08:16,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:08:16,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:16,678 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 8 treesize of output 7 [2018-09-30 20:08:16,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:16,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:16,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:18,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:18,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:18,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:18,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:19,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:19,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-30 20:08:19,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-30 20:08:19,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-30 20:08:19,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-30 20:08:19,034 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-09-30 20:08:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:22,570 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-30 20:08:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:08:22,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-09-30 20:08:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:22,572 INFO L225 Difference]: With dead ends: 84 [2018-09-30 20:08:22,572 INFO L226 Difference]: Without dead ends: 83 [2018-09-30 20:08:22,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-30 20:08:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-30 20:08:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-09-30 20:08:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-30 20:08:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-30 20:08:22,576 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-09-30 20:08:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:22,576 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-30 20:08:22,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-30 20:08:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-30 20:08:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-30 20:08:22,577 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:22,577 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-09-30 20:08:22,577 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:22,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-09-30 20:08:22,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:22,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:22,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:22,850 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:08:23,010 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:08:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:24,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:24,628 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:08:24,692 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 20:08:24,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:08:24,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:24,699 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 8 treesize of output 7 [2018-09-30 20:08:24,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:24,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:24,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:27,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:27,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:27,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:27,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:27,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:27,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-30 20:08:27,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-30 20:08:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-30 20:08:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 20:08:27,345 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-09-30 20:08:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:30,899 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-30 20:08:30,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:08:30,900 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-09-30 20:08:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:30,901 INFO L225 Difference]: With dead ends: 86 [2018-09-30 20:08:30,901 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 20:08:30,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 20:08:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 20:08:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-09-30 20:08:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-30 20:08:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-30 20:08:30,907 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-09-30 20:08:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:30,907 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-30 20:08:30,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-30 20:08:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-30 20:08:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-30 20:08:30,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:30,908 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-09-30 20:08:30,908 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:30,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:30,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-09-30 20:08:30,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:30,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:30,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:31,085 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:08:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:32,802 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:32,803 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:32,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:08:32,842 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:08:32,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:08:32,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:32,847 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 8 treesize of output 7 [2018-09-30 20:08:32,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:32,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:32,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:35,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:35,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:35,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:35,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:35,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:35,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-30 20:08:35,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-30 20:08:35,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-30 20:08:35,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 20:08:35,553 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-09-30 20:08:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:39,212 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-30 20:08:39,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 20:08:39,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-09-30 20:08:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:39,214 INFO L225 Difference]: With dead ends: 88 [2018-09-30 20:08:39,214 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 20:08:39,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 20:08:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 20:08:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-30 20:08:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-30 20:08:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-30 20:08:39,219 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-09-30 20:08:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:39,220 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-30 20:08:39,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-30 20:08:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-30 20:08:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 20:08:39,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:39,221 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-09-30 20:08:39,221 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:39,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:39,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-09-30 20:08:39,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:39,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:39,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:39,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:39,462 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:08:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:41,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:41,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:41,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:08:41,442 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 20:08:41,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:08:41,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:41,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:08:41,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:41,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:41,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:44,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:44,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:44,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:44,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:44,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:44,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-30 20:08:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-30 20:08:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-30 20:08:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-30 20:08:44,158 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-09-30 20:08:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:47,308 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-30 20:08:47,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 20:08:47,309 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-09-30 20:08:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:47,310 INFO L225 Difference]: With dead ends: 90 [2018-09-30 20:08:47,310 INFO L226 Difference]: Without dead ends: 89 [2018-09-30 20:08:47,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-30 20:08:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-30 20:08:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-09-30 20:08:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-30 20:08:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-30 20:08:47,315 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-09-30 20:08:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:47,315 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-30 20:08:47,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-30 20:08:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-30 20:08:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 20:08:47,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:47,316 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-09-30 20:08:47,316 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:47,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-09-30 20:08:47,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:47,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:49,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:49,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:49,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:08:49,297 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 20:08:49,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:08:49,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:49,302 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 8 treesize of output 7 [2018-09-30 20:08:49,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:49,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:49,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:08:52,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:08:52,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:52,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:52,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:08:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:52,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:52,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-30 20:08:52,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-30 20:08:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-30 20:08:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 20:08:52,459 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-09-30 20:08:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:57,076 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-30 20:08:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 20:08:57,076 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-09-30 20:08:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:57,077 INFO L225 Difference]: With dead ends: 92 [2018-09-30 20:08:57,078 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 20:08:57,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 20:08:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 20:08:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-09-30 20:08:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-30 20:08:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-30 20:08:57,082 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-09-30 20:08:57,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:57,082 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-30 20:08:57,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-30 20:08:57,083 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-30 20:08:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-30 20:08:57,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:57,083 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-09-30 20:08:57,083 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:57,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-09-30 20:08:57,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:57,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:57,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:08:57,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:57,362 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:08:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:59,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:59,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:59,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:59,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:59,298 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 8 treesize of output 7 [2018-09-30 20:08:59,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:08:59,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:08:59,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:09:02,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:09:02,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:02,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:02,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:09:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:02,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:02,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-30 20:09:02,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-30 20:09:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-30 20:09:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-30 20:09:02,372 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-09-30 20:09:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:07,252 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-30 20:09:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:09:07,253 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-09-30 20:09:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:07,254 INFO L225 Difference]: With dead ends: 94 [2018-09-30 20:09:07,254 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 20:09:07,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-30 20:09:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 20:09:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-09-30 20:09:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-30 20:09:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-30 20:09:07,259 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-09-30 20:09:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:07,259 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-30 20:09:07,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-30 20:09:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-30 20:09:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-30 20:09:07,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:07,260 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-09-30 20:09:07,261 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:07,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:07,261 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-09-30 20:09:07,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:07,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:07,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:07,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:07,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:07,549 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:09:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:09,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:09,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:09,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:09:09,545 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:09:09,545 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:09:09,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:09,550 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 8 treesize of output 7 [2018-09-30 20:09:09,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:09,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:09,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:09:12,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:09:12,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:12,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:12,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:09:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:12,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:12,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-30 20:09:12,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-30 20:09:12,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-30 20:09:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-30 20:09:12,813 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-09-30 20:09:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:17,782 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-30 20:09:17,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:09:17,783 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-09-30 20:09:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:17,784 INFO L225 Difference]: With dead ends: 96 [2018-09-30 20:09:17,784 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 20:09:17,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-30 20:09:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 20:09:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-30 20:09:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-30 20:09:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-30 20:09:17,789 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-09-30 20:09:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:17,789 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-30 20:09:17,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-30 20:09:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-30 20:09:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-30 20:09:17,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:17,790 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-09-30 20:09:17,790 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:17,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-09-30 20:09:17,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:17,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:17,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:09:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:19,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:19,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:19,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:09:20,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 20:09:20,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:09:20,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:20,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:09:20,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:20,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:20,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:09:23,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:09:23,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:23,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:23,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:09:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:23,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:23,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-30 20:09:23,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-30 20:09:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-30 20:09:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 20:09:23,560 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-09-30 20:09:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:28,987 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-30 20:09:28,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:09:28,987 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-09-30 20:09:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:28,988 INFO L225 Difference]: With dead ends: 98 [2018-09-30 20:09:28,989 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 20:09:28,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 20:09:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 20:09:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-09-30 20:09:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 20:09:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-30 20:09:28,993 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-09-30 20:09:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:28,993 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-30 20:09:28,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-30 20:09:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-30 20:09:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-30 20:09:28,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:28,994 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-09-30 20:09:28,994 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:28,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:28,994 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-09-30 20:09:28,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:28,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:28,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:09:28,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:29,237 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:09:29,461 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 20:09:29,673 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:09:29,952 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 20:09:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:32,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:32,322 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:32,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:09:32,361 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:09:32,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:09:32,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:32,367 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 8 treesize of output 7 [2018-09-30 20:09:32,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:32,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:32,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:09:35,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:09:35,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:35,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:35,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:09:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:35,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:35,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-30 20:09:35,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-30 20:09:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-30 20:09:35,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-30 20:09:35,613 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-09-30 20:09:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:40,188 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-30 20:09:40,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:09:40,188 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-09-30 20:09:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:40,190 INFO L225 Difference]: With dead ends: 100 [2018-09-30 20:09:40,190 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 20:09:40,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-30 20:09:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 20:09:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-30 20:09:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 20:09:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-30 20:09:40,194 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-09-30 20:09:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:40,195 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-30 20:09:40,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-30 20:09:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-30 20:09:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-30 20:09:40,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:40,196 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-09-30 20:09:40,196 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:40,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:40,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-09-30 20:09:40,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:40,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:40,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:09:40,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:42,620 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:42,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:42,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:09:42,700 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 20:09:42,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:09:42,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:42,724 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 8 treesize of output 7 [2018-09-30 20:09:42,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:42,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:42,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:09:47,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:09:47,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:47,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:47,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:09:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:47,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:47,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-30 20:09:47,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-30 20:09:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-30 20:09:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 20:09:47,674 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-09-30 20:09:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:51,448 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-30 20:09:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 20:09:51,448 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-09-30 20:09:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:51,449 INFO L225 Difference]: With dead ends: 102 [2018-09-30 20:09:51,449 INFO L226 Difference]: Without dead ends: 101 [2018-09-30 20:09:51,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 20:09:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-30 20:09:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-30 20:09:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 20:09:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-30 20:09:51,455 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-09-30 20:09:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:51,455 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-30 20:09:51,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-30 20:09:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-30 20:09:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 20:09:51,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:51,456 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-09-30 20:09:51,457 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:51,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-09-30 20:09:51,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:51,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:09:51,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:54,059 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:54,059 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:54,066 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:09:54,140 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 20:09:54,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:09:54,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:54,149 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 8 treesize of output 7 [2018-09-30 20:09:54,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:54,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:54,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:09:57,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:09:57,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:09:57,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:09:57,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:09:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:58,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:58,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-30 20:09:58,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-30 20:09:58,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-30 20:09:58,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 20:09:58,027 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-09-30 20:10:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:04,214 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-30 20:10:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 20:10:04,215 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-09-30 20:10:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:04,216 INFO L225 Difference]: With dead ends: 104 [2018-09-30 20:10:04,216 INFO L226 Difference]: Without dead ends: 103 [2018-09-30 20:10:04,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 20:10:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-30 20:10:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-09-30 20:10:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-30 20:10:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-30 20:10:04,222 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-09-30 20:10:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:04,223 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-30 20:10:04,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-30 20:10:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-30 20:10:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-30 20:10:04,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:04,224 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-09-30 20:10:04,224 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-09-30 20:10:04,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:04,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:10:04,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:10:06,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:06,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:10:06,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:06,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:06,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:10:06,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:10:06,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:10:06,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 20:10:10,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 20:10:10,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:10:10,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:10:10,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 20:10:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:10:10,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:10,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-30 20:10:10,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-30 20:10:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-30 20:10:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-30 20:10:10,627 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. Received shutdown request... [2018-09-30 20:10:15,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:10:15,808 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:10:15,885 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:10:15,885 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:10:15 BoogieIcfgContainer [2018-09-30 20:10:15,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:10:15,886 INFO L168 Benchmark]: Toolchain (without parser) took 246414.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 653.8 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -696.1 MB). Peak memory consumption was 210.6 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:15,887 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:15,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:15,887 INFO L168 Benchmark]: Boogie Preprocessor took 23.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:15,888 INFO L168 Benchmark]: RCFGBuilder took 250.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:15,888 INFO L168 Benchmark]: TraceAbstraction took 246088.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 653.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -717.3 MB). Peak memory consumption was 189.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:15,891 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.89 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 23.86 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 250.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246088.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 653.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -717.3 MB). Peak memory consumption was 189.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (102states) and FLOYD_HOARE automaton (currently 54 states, 105 states before enhancement), while ReachableStatesComputation was computing reachable states (101 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 246.0s OverallTime, 50 OverallIterations, 50 TraceHistogramMax, 97.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 128 SDslu, 2 SDs, 0 SdLazy, 136151 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3922 GetRequests, 1176 SyntacticMatches, 49 SemanticMatches, 2697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24696 ImplicationChecksByTransitivity, 138.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 49 MinimizatonAttempts, 49 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 142.9s InterpolantComputationTime, 5197 NumberOfCodeBlocks, 5197 NumberOfCodeBlocksAsserted, 731 NumberOfCheckSat, 5098 ConstructedInterpolants, 0 QuantifiedInterpolants, 5742568 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5390 ConjunctsInSsa, 2793 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/83300 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/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-10-15-900.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-10-15-900.csv Completed graceful shutdown