java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:25:15,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:25:15,194 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:25:15,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:25:15,211 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:25:15,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:25:15,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:25:15,224 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:25:15,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:25:15,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:25:15,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:25:15,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:25:15,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:25:15,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:25:15,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:25:15,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:25:15,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:25:15,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:25:15,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:25:15,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:25:15,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:25:15,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:25:15,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:25:15,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:25:15,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:25:15,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:25:15,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:25:15,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:25:15,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:25:15,264 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:25:15,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:25:15,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:25:15,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:25:15,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:25:15,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:25:15,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:25:15,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:25:15,292 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:25:15,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:25:15,293 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:25:15,293 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:25:15,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:25:15,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:25:15,297 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:25:15,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:25:15,297 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:25:15,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:25:15,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:25:15,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:25:15,298 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:25:15,298 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:25:15,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:25:15,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:25:15,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:25:15,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:25:15,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:25:15,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:25:15,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:25:15,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:25:15,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:25:15,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:25:15,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:25:15,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:25:15,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:25:15,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:25:15,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:25:15,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:25:15,302 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:25:15,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:25:15,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:25:15,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:25:15,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:25:15,388 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:25:15,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2018-10-04 14:25:15,390 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2018-10-04 14:25:15,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:25:15,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:25:15,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:25:15,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:25:15,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:25:15,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:25:15,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:25:15,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:25:15,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:25:15,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... [2018-10-04 14:25:15,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:25:15,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:25:15,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:25:15,520 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:25:15,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:25:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:25:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:25:15,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:25:15,768 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:25:15 BoogieIcfgContainer [2018-10-04 14:25:15,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:25:15,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:25:15,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:25:15,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:25:15,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:25:15" (1/2) ... [2018-10-04 14:25:15,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ada69b4 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:25:15, skipping insertion in model container [2018-10-04 14:25:15,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:25:15" (2/2) ... [2018-10-04 14:25:15,776 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bpl [2018-10-04 14:25:15,786 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:25:15,794 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:25:15,849 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:25:15,850 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:25:15,851 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:25:15,852 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:25:15,853 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:25:15,853 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:25:15,853 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:25:15,853 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:25:15,853 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:25:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 14:25:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:25:15,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:15,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 14:25:15,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:15,897 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 14:25:15,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:15,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:15,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:16,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:25:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:25:16,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:25:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:25:16,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:16,085 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 14:25:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:16,121 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-04 14:25:16,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:25:16,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 14:25:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:16,134 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:25:16,134 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:25:16,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:25:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:25:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:25:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:25:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 14:25:16,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-04 14:25:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:16,172 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 14:25:16,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:25:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 14:25:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:25:16,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:16,173 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-04 14:25:16,173 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:16,173 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-04 14:25:16,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:16,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:16,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:16,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:16,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:16,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:16,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:16,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:25:16,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:25:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:25:16,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:16,530 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-04 14:25:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:16,570 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 14:25:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:25:16,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 14:25:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:16,572 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:25:16,572 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:25:16,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 2 [2018-10-04 14:25:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:25:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:25:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:25:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 14:25:16,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-04 14:25:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:16,577 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 14:25:16,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:25:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 14:25:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:25:16,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:16,577 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-04 14:25:16,578 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:16,578 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-04 14:25:16,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:16,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:16,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:16,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:16,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:16,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:16,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:16,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:16,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:25:16,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:25:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:25:16,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:16,813 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-04 14:25:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:16,847 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:25:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:25:16,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-04 14:25:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:16,848 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:25:16,848 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:25:16,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:25:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:25:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:25:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:25:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:25:16,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 14:25:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:16,854 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:25:16,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:25:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:25:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:25:16,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:16,855 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-04 14:25:16,855 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:16,855 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-04 14:25:16,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:16,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:16,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:17,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:17,102 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) [2018-10-04 14:25:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:17,141 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:25:17,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:17,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:17,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:17,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:25:17,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:25:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:25:17,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:17,383 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-04 14:25:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:17,427 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 14:25:17,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:25:17,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-04 14:25:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:17,429 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:25:17,429 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:25:17,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 4 [2018-10-04 14:25:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:25:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 14:25:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:25:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 14:25:17,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-04 14:25:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:17,436 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 14:25:17,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:25:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 14:25:17,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:25:17,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:17,438 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-04 14:25:17,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:17,438 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:17,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-04 14:25:17,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:17,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:17,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:17,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:17,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:17,610 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:17,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:17,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:17,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:17,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:25:17,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:25:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:25:17,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:17,719 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-04 14:25:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:17,864 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 14:25:17,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:25:17,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-04 14:25:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:17,865 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:25:17,865 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:25:17,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:25:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:25:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 14:25:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:25:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 14:25:17,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-04 14:25:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:17,871 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 14:25:17,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:25:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 14:25:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:25:17,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:17,872 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-04 14:25:17,872 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:17,873 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-04 14:25:17,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:17,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:18,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:18,048 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:18,083 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 14:25:18,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:18,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:18,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:18,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:25:18,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:25:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:25:18,196 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:18,196 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-04 14:25:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:18,301 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 14:25:18,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:25:18,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-04 14:25:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:18,303 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:25:18,303 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:25:18,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 6 [2018-10-04 14:25:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:25:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 14:25:18,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 14:25:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 14:25:18,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-04 14:25:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:18,309 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 14:25:18,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:25:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 14:25:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:25:18,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:18,315 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-04 14:25:18,315 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:18,315 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-04 14:25:18,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:18,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:18,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:18,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:18,883 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:18,919 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:25:18,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:18,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:19,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:25:19,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:25:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:25:19,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:19,046 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-04 14:25:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:19,119 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 14:25:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:25:19,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-04 14:25:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:19,121 INFO L225 Difference]: With dead ends: 21 [2018-10-04 14:25:19,122 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:25:19,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 7 [2018-10-04 14:25:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:25:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 14:25:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:25:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 14:25:19,127 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-04 14:25:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:19,127 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 14:25:19,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:25:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 14:25:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:25:19,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:19,128 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-04 14:25:19,129 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:19,129 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-04 14:25:19,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:19,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:19,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:19,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:19,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:19,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:19,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:19,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:25:19,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:25:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:25:19,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:19,505 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-04 14:25:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:19,580 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 14:25:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:25:19,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-04 14:25:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:19,582 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:25:19,582 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:25:19,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 14:25:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:25:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:25:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:25:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 14:25:19,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-04 14:25:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:19,588 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 14:25:19,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:25:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 14:25:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:25:19,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:19,589 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-04 14:25:19,589 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:19,589 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-04 14:25:19,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:19,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:19,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:19,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:19,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:19,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:19,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:19,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:19,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:19,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:25:19,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:25:19,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:25:19,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:19,923 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-04 14:25:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:20,087 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 14:25:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:25:20,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-04 14:25:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:20,092 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:25:20,093 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:25:20,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:25:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:25:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:25:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:25:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 14:25:20,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-04 14:25:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:20,098 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 14:25:20,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:25:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 14:25:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:25:20,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:20,099 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-04 14:25:20,100 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:20,100 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-04 14:25:20,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:20,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:20,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:20,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 14:25:20,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:20,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:20,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:20,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:25:20,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:25:20,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:25:20,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:20,509 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-04 14:25:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:20,658 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 14:25:20,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:25:20,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-04 14:25:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:20,659 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:25:20,660 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:25:20,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 14:25:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:25:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 14:25:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:25:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 14:25:20,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-04 14:25:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:20,665 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 14:25:20,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:25:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 14:25:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:25:20,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:20,666 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-04 14:25:20,666 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:20,667 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-04 14:25:20,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:20,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:21,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:21,050 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:21,074 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:21,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:21,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:21,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:21,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:25:21,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:25:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:25:21,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:21,467 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-04 14:25:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:21,679 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 14:25:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:25:21,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-04 14:25:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:21,681 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:25:21,681 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:25:21,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 11 [2018-10-04 14:25:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:25:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:25:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:25:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 14:25:21,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-04 14:25:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:21,693 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 14:25:21,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:25:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 14:25:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 14:25:21,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:21,694 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-04 14:25:21,694 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:21,694 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-04 14:25:21,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:21,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:21,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:21,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:21,939 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:21,947 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:25,604 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 14:25:25,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:25,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:25,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:25,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:25:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:25:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:25:25,932 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:25,932 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-04 14:25:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:26,130 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 14:25:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:25:26,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-04 14:25:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:26,132 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:25:26,132 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:25:26,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 12 [2018-10-04 14:25:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:25:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:25:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:25:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 14:25:26,138 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-04 14:25:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:26,138 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 14:25:26,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:25:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 14:25:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:25:26,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:26,139 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-04 14:25:26,139 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:26,140 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-04 14:25:26,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:26,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:26,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:26,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:26,445 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:26,460 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:26,581 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:25:26,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:26,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:26,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:26,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:25:26,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:25:26,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:25:26,734 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:26,734 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-04 14:25:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:26,894 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 14:25:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:25:26,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-04 14:25:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:26,895 INFO L225 Difference]: With dead ends: 33 [2018-10-04 14:25:26,896 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:25:26,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 14:25:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:25:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:25:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:25:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 14:25:26,902 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-04 14:25:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:26,902 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 14:25:26,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:25:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 14:25:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:25:26,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:26,903 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-04 14:25:26,904 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:26,904 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-04 14:25:26,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:26,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:27,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:27,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:27,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:27,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:27,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:25:27,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:25:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:25:27,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:27,919 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-04 14:25:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:28,113 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 14:25:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:25:28,114 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-04 14:25:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:28,114 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:25:28,115 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 14:25:28,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 14 [2018-10-04 14:25:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 14:25:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 14:25:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 14:25:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 14:25:28,121 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-04 14:25:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:28,122 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 14:25:28,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:25:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 14:25:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 14:25:28,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:28,123 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-04 14:25:28,123 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:28,124 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-04 14:25:28,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:28,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:28,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:28,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:28,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:28,373 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:28,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:28,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:28,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:28,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:29,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:25:29,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:25:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:25:29,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:29,115 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-04 14:25:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:29,357 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 14:25:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:25:29,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-04 14:25:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:29,359 INFO L225 Difference]: With dead ends: 37 [2018-10-04 14:25:29,359 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 14:25:29,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.1s impTime 15 [2018-10-04 14:25:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 14:25:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 14:25:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:25:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 14:25:29,365 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-04 14:25:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:29,365 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 14:25:29,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:25:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 14:25:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 14:25:29,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:29,366 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-04 14:25:29,367 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:29,367 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-04 14:25:29,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:29,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:29,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:29,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:30,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 14:25:30,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:30,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:30,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:30,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:25:30,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:25:30,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:25:30,169 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:30,169 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-04 14:25:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:30,371 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 14:25:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:25:30,372 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-04 14:25:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:30,373 INFO L225 Difference]: With dead ends: 39 [2018-10-04 14:25:30,373 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 14:25:30,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 16 [2018-10-04 14:25:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 14:25:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 14:25:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 14:25:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 14:25:30,379 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-04 14:25:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:30,379 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 14:25:30,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:25:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 14:25:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:25:30,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:30,381 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-04 14:25:30,381 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:30,381 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-04 14:25:30,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:30,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:30,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:30,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:30,740 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:30,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:30,767 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:30,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:30,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:30,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:30,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:25:30,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:25:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:25:30,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:30,960 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-10-04 14:25:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:31,348 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 14:25:31,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:25:31,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-10-04 14:25:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:31,350 INFO L225 Difference]: With dead ends: 41 [2018-10-04 14:25:31,350 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:25:31,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 17 [2018-10-04 14:25:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:25:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 14:25:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 14:25:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 14:25:31,355 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-04 14:25:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:31,355 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 14:25:31,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:25:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 14:25:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:25:31,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:31,357 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-10-04 14:25:31,357 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:31,357 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-10-04 14:25:31,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:31,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:31,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:32,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:32,038 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:25:32,046 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:02,642 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 14:26:02,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:02,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:02,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:26:02,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:26:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:26:02,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:02,792 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-10-04 14:26:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:03,052 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 14:26:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:26:03,052 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-10-04 14:26:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:03,053 INFO L225 Difference]: With dead ends: 43 [2018-10-04 14:26:03,053 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:26:03,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 18 [2018-10-04 14:26:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:26:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:26:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:26:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 14:26:03,060 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-04 14:26:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:03,061 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 14:26:03,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:26:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 14:26:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:26:03,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:03,062 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-10-04 14:26:03,062 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:03,063 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-10-04 14:26:03,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:03,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:03,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:03,388 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:03,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:13,363 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:26:13,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:13,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:13,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:13,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:26:13,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:26:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:26:13,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:13,536 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-10-04 14:26:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:14,169 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 14:26:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:26:14,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-10-04 14:26:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:14,170 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:26:14,171 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 14:26:14,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 19 [2018-10-04 14:26:14,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 14:26:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 14:26:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 14:26:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 14:26:14,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-04 14:26:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:14,177 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 14:26:14,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:26:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 14:26:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:26:14,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:14,178 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-10-04 14:26:14,178 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:14,178 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-10-04 14:26:14,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:14,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:14,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:14,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:14,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:14,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:14,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:14,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:14,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:26:14,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:26:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:26:14,692 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:14,692 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-10-04 14:26:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:15,106 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 14:26:15,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:26:15,106 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-10-04 14:26:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:15,107 INFO L225 Difference]: With dead ends: 47 [2018-10-04 14:26:15,107 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 14:26:15,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 20 [2018-10-04 14:26:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 14:26:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 14:26:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 14:26:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 14:26:15,114 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-04 14:26:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:15,115 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 14:26:15,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:26:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 14:26:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:26:15,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:15,116 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-10-04 14:26:15,116 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:15,116 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:15,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-10-04 14:26:15,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:15,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:15,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:15,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:15,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:15,500 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:15,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:15,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:15,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:15,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:26:15,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:26:15,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:26:15,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:15,623 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-10-04 14:26:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:15,945 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 14:26:15,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:26:15,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-10-04 14:26:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:15,946 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:26:15,946 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:26:15,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 21 [2018-10-04 14:26:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:26:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 14:26:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 14:26:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 14:26:15,954 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-04 14:26:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:15,954 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 14:26:15,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:26:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 14:26:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 14:26:15,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:15,955 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-10-04 14:26:15,955 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:15,956 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-10-04 14:26:15,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:15,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:15,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:16,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:16,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:16,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:24,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 14:26:24,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:24,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:24,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:24,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:26:24,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:26:24,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:26:24,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:24,708 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-10-04 14:26:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:25,037 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 14:26:25,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:26:25,040 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-10-04 14:26:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:25,041 INFO L225 Difference]: With dead ends: 51 [2018-10-04 14:26:25,041 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:26:25,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 22 [2018-10-04 14:26:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:26:25,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 14:26:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 14:26:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 14:26:25,046 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-04 14:26:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:25,047 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 14:26:25,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:26:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 14:26:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:26:25,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:25,048 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-10-04 14:26:25,048 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:25,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-10-04 14:26:25,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:25,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:25,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:26,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:26,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:26,058 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:26,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:26,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:26,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:26,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:26:26,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:26:26,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:26:26,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:26,182 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-10-04 14:26:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:26,538 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 14:26:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:26:26,539 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-04 14:26:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:26,539 INFO L225 Difference]: With dead ends: 53 [2018-10-04 14:26:26,539 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:26:26,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 23 [2018-10-04 14:26:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:26:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:26:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:26:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 14:26:26,546 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-04 14:26:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:26,546 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 14:26:26,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:26:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 14:26:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 14:26:26,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:26,547 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-10-04 14:26:26,548 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:26,548 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-10-04 14:26:26,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:26,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:26,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:26,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:27,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:27,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:27,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:27:38,454 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 14:27:38,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:27:40,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:27:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:27:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:27:40,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:27:40,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:27:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:27:40,405 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:27:40,405 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-10-04 14:27:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:27:40,799 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 14:27:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:27:40,800 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-10-04 14:27:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:27:40,800 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:27:40,801 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:27:40,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 24 [2018-10-04 14:27:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:27:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 14:27:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 14:27:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 14:27:40,806 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-04 14:27:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:27:40,806 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 14:27:40,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:27:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 14:27:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:27:40,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:27:40,807 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-10-04 14:27:40,808 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:27:40,808 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:27:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-10-04 14:27:40,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:27:40,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:27:40,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:40,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:27:40,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:27:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:27:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:27:42,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:27:42,173 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:27:42,196 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:28:05,582 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:28:05,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:05,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:05,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:05,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:28:05,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:28:05,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:28:05,729 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:05,729 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-10-04 14:28:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:06,139 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 14:28:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:28:06,140 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-04 14:28:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:06,141 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:28:06,141 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:28:06,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 25 [2018-10-04 14:28:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:28:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 14:28:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:28:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 14:28:06,147 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-04 14:28:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:06,147 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 14:28:06,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:28:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 14:28:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:28:06,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:06,148 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-10-04 14:28:06,148 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:06,148 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-10-04 14:28:06,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:06,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:06,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:06,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:06,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:06,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:06,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:07,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:07,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:07,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:28:07,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:28:07,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:28:07,173 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:07,173 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-10-04 14:28:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:07,616 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 14:28:07,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:28:07,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-10-04 14:28:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:07,617 INFO L225 Difference]: With dead ends: 59 [2018-10-04 14:28:07,617 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:28:07,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 26 [2018-10-04 14:28:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:28:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 14:28:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:28:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 14:28:07,623 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-04 14:28:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:07,623 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 14:28:07,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:28:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 14:28:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 14:28:07,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:07,624 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-10-04 14:28:07,624 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:07,625 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-10-04 14:28:07,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:07,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:07,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:28:07,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:09,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:09,373 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:09,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:28:09,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:28:09,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:09,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:09,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:09,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:28:09,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:28:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:28:09,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:09,571 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-10-04 14:28:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:10,198 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 14:28:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:28:10,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-04 14:28:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:10,200 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:28:10,200 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:28:10,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 27 [2018-10-04 14:28:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:28:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 14:28:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 14:28:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 14:28:10,205 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-04 14:28:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:10,205 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 14:28:10,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:28:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 14:28:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:28:10,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:10,206 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-10-04 14:28:10,206 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:10,206 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-10-04 14:28:10,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:10,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:10,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:10,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:12,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:12,169 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:12,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:28:21,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 14:28:21,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:21,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:21,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:21,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:28:21,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:28:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:28:21,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:21,956 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-10-04 14:28:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:22,469 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 14:28:22,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:28:22,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-10-04 14:28:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:22,470 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:28:22,470 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 14:28:22,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time 1.5s impTime 28 [2018-10-04 14:28:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 14:28:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 14:28:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 14:28:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 14:28:22,476 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-04 14:28:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:22,476 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 14:28:22,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:28:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 14:28:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 14:28:22,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:22,477 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-10-04 14:28:22,477 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:22,478 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-10-04 14:28:22,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:22,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:23,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:23,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:23,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:28:23,934 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:28:23,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:28:23,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:28:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:24,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:28:24,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:28:24,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:28:24,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:28:24,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:28:24,115 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-10-04 14:28:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:28:24,750 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 14:28:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:28:24,750 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-10-04 14:28:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:28:24,751 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:28:24,751 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:28:24,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 29 [2018-10-04 14:28:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:28:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:28:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:28:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 14:28:24,759 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-04 14:28:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:28:24,760 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 14:28:24,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:28:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 14:28:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:28:24,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:28:24,760 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-10-04 14:28:24,761 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:28:24,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:28:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-10-04 14:28:24,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:28:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:28:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:24,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:28:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:28:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:28:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:28:25,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:28:25,592 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:28:25,600 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown