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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:23:11,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:23:11,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:23:11,884 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:23:11,884 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:23:11,885 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:23:11,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:23:11,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:23:11,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:23:11,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:23:11,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:23:11,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:23:11,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:23:11,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:23:11,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:23:11,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:23:11,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:23:11,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:23:11,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:23:11,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:23:11,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:23:11,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:23:11,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:23:11,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:23:11,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:23:11,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:23:11,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:23:11,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:23:11,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:23:11,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:23:11,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:23:11,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:23:11,914 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:23:11,914 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:23:11,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:23:11,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:23:11,916 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:23:11,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:23:11,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:23:11,934 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:23:11,935 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:23:11,935 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:23:11,935 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:23:11,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:23:11,936 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:23:11,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:23:11,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:23:11,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:23:11,938 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:23:11,938 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:23:11,939 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:23:11,939 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:23:12,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:23:12,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:23:12,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:23:12,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:23:12,019 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:23:12,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2018-10-10 15:23:12,020 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl' [2018-10-10 15:23:12,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:23:12,108 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:23:12,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:23:12,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:23:12,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:23:12,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/1) ... [2018-10-10 15:23:12,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:23:12,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:23:12,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:23:12,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:23:12,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:23:12,272 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:23:12,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:23:12,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:23:12,887 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:23:12,887 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:23:12 BoogieIcfgContainer [2018-10-10 15:23:12,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:23:12,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:23:12,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:23:12,893 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:23:12,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:23:12" (1/2) ... [2018-10-10 15:23:12,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9c0ace and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:23:12, skipping insertion in model container [2018-10-10 15:23:12,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:23:12" (2/2) ... [2018-10-10 15:23:12,896 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2018-10-10 15:23:12,906 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:23:12,917 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:23:12,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:23:12,963 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:23:12,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:23:12,964 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:23:12,964 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:23:12,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:23:12,964 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:23:12,965 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:23:12,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:23:12,965 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:23:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 15:23:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 15:23:12,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:12,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:12,995 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:13,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2107550204, now seen corresponding path program 1 times [2018-10-10 15:23:13,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:13,289 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-10 15:23:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:23:13,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 15:23:13,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:23:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:23:13,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:23:13,316 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2018-10-10 15:23:13,593 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 15:23:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:13,728 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-10 15:23:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:23:13,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-10 15:23:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:13,746 INFO L225 Difference]: With dead ends: 127 [2018-10-10 15:23:13,746 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 15:23:13,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:23:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 15:23:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2018-10-10 15:23:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 15:23:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-10 15:23:13,794 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-10-10 15:23:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:13,796 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-10 15:23:13,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:23:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-10 15:23:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 15:23:13,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:13,800 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:13,800 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:13,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash -477820300, now seen corresponding path program 1 times [2018-10-10 15:23:13,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:14,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:14,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:23:14,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:23:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:23:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:23:14,180 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 8 states. [2018-10-10 15:23:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:14,758 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-10-10 15:23:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:23:14,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-10 15:23:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:14,762 INFO L225 Difference]: With dead ends: 129 [2018-10-10 15:23:14,762 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 15:23:14,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:23:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 15:23:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2018-10-10 15:23:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-10 15:23:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-10-10 15:23:14,775 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 60 [2018-10-10 15:23:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:14,776 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-10-10 15:23:14,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:23:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-10-10 15:23:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 15:23:14,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:14,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:14,780 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:14,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -137107452, now seen corresponding path program 2 times [2018-10-10 15:23:14,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 15:23:15,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:23:15,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 15:23:15,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:23:15,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:23:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:15,336 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 12 states. [2018-10-10 15:23:16,091 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-10 15:23:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:16,274 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2018-10-10 15:23:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:23:16,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-10-10 15:23:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:16,279 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:23:16,279 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:23:16,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:23:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:23:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-10-10 15:23:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 15:23:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-10 15:23:16,290 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 75 [2018-10-10 15:23:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:16,290 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-10 15:23:16,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:23:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-10-10 15:23:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 15:23:16,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:16,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:16,293 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:16,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1373892969, now seen corresponding path program 1 times [2018-10-10 15:23:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 15:23:16,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:16,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:23:16,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:23:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:23:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:23:16,594 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 8 states. [2018-10-10 15:23:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:16,867 INFO L93 Difference]: Finished difference Result 182 states and 185 transitions. [2018-10-10 15:23:16,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:23:16,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-10-10 15:23:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:16,870 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:23:16,870 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:23:16,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:23:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:23:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 133. [2018-10-10 15:23:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 15:23:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-10 15:23:16,881 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 100 [2018-10-10 15:23:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:16,882 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-10 15:23:16,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:23:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-10 15:23:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:23:16,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:16,885 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:16,885 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:16,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash 799381615, now seen corresponding path program 2 times [2018-10-10 15:23:16,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 15:23:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:23:17,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:23:17,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:23:17,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:23:17,107 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 10 states. [2018-10-10 15:23:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:17,430 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2018-10-10 15:23:17,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:23:17,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-10 15:23:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:17,440 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:23:17,440 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:23:17,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:23:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:23:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 148. [2018-10-10 15:23:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 15:23:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-10-10 15:23:17,465 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 115 [2018-10-10 15:23:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:17,465 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-10 15:23:17,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:23:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-10-10 15:23:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 15:23:17,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:17,475 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:17,476 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:17,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:17,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1760314537, now seen corresponding path program 3 times [2018-10-10 15:23:17,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 15:23:17,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:17,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:23:17,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:23:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:23:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:17,740 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 12 states. [2018-10-10 15:23:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:18,237 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-10-10 15:23:18,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:23:18,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-10 15:23:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:18,239 INFO L225 Difference]: With dead ends: 199 [2018-10-10 15:23:18,240 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 15:23:18,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:23:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 15:23:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-10-10 15:23:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 15:23:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-10-10 15:23:18,249 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 130 [2018-10-10 15:23:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:18,249 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-10-10 15:23:18,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:23:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-10-10 15:23:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 15:23:18,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:18,252 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:18,253 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:18,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:18,253 INFO L82 PathProgramCache]: Analyzing trace with hash -687579857, now seen corresponding path program 4 times [2018-10-10 15:23:18,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 15:23:19,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:19,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:23:19,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:23:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:23:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:23:19,284 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 15 states. [2018-10-10 15:23:19,978 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-10-10 15:23:20,105 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-10-10 15:23:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:20,648 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-10-10 15:23:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:23:20,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2018-10-10 15:23:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:20,650 INFO L225 Difference]: With dead ends: 222 [2018-10-10 15:23:20,650 INFO L226 Difference]: Without dead ends: 222 [2018-10-10 15:23:20,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:23:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-10 15:23:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 185. [2018-10-10 15:23:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 15:23:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2018-10-10 15:23:20,658 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 145 [2018-10-10 15:23:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:20,658 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2018-10-10 15:23:20,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:23:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2018-10-10 15:23:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:23:20,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:20,661 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:20,662 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:20,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1959652706, now seen corresponding path program 5 times [2018-10-10 15:23:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 142 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 15:23:20,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:20,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:23:20,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:23:20,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:23:20,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:23:20,874 INFO L87 Difference]: Start difference. First operand 185 states and 188 transitions. Second operand 10 states. [2018-10-10 15:23:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:21,133 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-10-10 15:23:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:23:21,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2018-10-10 15:23:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:21,135 INFO L225 Difference]: With dead ends: 211 [2018-10-10 15:23:21,135 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 15:23:21,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:23:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 15:23:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2018-10-10 15:23:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:23:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-10 15:23:21,140 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 170 [2018-10-10 15:23:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:21,141 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-10 15:23:21,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:23:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-10 15:23:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:23:21,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:21,144 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:21,144 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:21,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -245086566, now seen corresponding path program 6 times [2018-10-10 15:23:21,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 17 proven. 220 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 15:23:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:23:21,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:23:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:23:21,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:21,512 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 12 states. [2018-10-10 15:23:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:21,942 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-10-10 15:23:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:23:21,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2018-10-10 15:23:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:21,946 INFO L225 Difference]: With dead ends: 226 [2018-10-10 15:23:21,946 INFO L226 Difference]: Without dead ends: 226 [2018-10-10 15:23:21,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:23:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-10 15:23:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 201. [2018-10-10 15:23:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:23:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2018-10-10 15:23:21,954 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 185 [2018-10-10 15:23:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:21,954 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2018-10-10 15:23:21,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:23:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2018-10-10 15:23:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:23:21,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:21,957 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:21,958 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:21,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:21,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1002183454, now seen corresponding path program 7 times [2018-10-10 15:23:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 17 proven. 313 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 15:23:22,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:22,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:23:22,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:23:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:23:22,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:23:22,164 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand 14 states. [2018-10-10 15:23:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:22,636 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-10-10 15:23:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:23:22,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 200 [2018-10-10 15:23:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:22,638 INFO L225 Difference]: With dead ends: 241 [2018-10-10 15:23:22,639 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 15:23:22,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:23:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 15:23:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2018-10-10 15:23:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:23:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2018-10-10 15:23:22,644 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 200 [2018-10-10 15:23:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:22,645 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2018-10-10 15:23:22,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:23:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2018-10-10 15:23:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:23:22,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:22,648 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:22,648 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:22,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:22,649 INFO L82 PathProgramCache]: Analyzing trace with hash 863514138, now seen corresponding path program 8 times [2018-10-10 15:23:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 17 proven. 421 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 15:23:23,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:23,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:23:23,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:23:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:23:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:23:23,039 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand 16 states. [2018-10-10 15:23:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:23,736 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-10 15:23:23,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:23:23,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-10-10 15:23:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:23,739 INFO L225 Difference]: With dead ends: 243 [2018-10-10 15:23:23,739 INFO L226 Difference]: Without dead ends: 243 [2018-10-10 15:23:23,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:23:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-10 15:23:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-10-10 15:23:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:23:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-10-10 15:23:23,745 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 215 [2018-10-10 15:23:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:23,746 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-10-10 15:23:23,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:23:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-10-10 15:23:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:23:23,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:23,748 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:23,748 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:23,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1720958050, now seen corresponding path program 9 times [2018-10-10 15:23:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:24,534 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:23:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 467 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-10-10 15:23:24,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:24,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:23:24,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:23:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:23:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:23:24,880 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 18 states. [2018-10-10 15:23:25,736 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-10 15:23:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:26,334 INFO L93 Difference]: Finished difference Result 399 states and 404 transitions. [2018-10-10 15:23:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:23:26,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2018-10-10 15:23:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:26,343 INFO L225 Difference]: With dead ends: 399 [2018-10-10 15:23:26,343 INFO L226 Difference]: Without dead ends: 399 [2018-10-10 15:23:26,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:23:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-10 15:23:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 316. [2018-10-10 15:23:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-10 15:23:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 320 transitions. [2018-10-10 15:23:26,351 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 320 transitions. Word has length 230 [2018-10-10 15:23:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:26,352 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 320 transitions. [2018-10-10 15:23:26,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:23:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 320 transitions. [2018-10-10 15:23:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-10 15:23:26,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:26,354 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:26,355 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:26,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:26,355 INFO L82 PathProgramCache]: Analyzing trace with hash -131334001, now seen corresponding path program 10 times [2018-10-10 15:23:26,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 0 proven. 1095 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-10 15:23:27,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:27,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:23:27,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:23:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:23:27,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:23:27,267 INFO L87 Difference]: Start difference. First operand 316 states and 320 transitions. Second operand 22 states. [2018-10-10 15:23:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:28,901 INFO L93 Difference]: Finished difference Result 484 states and 490 transitions. [2018-10-10 15:23:28,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:23:28,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 315 [2018-10-10 15:23:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:28,906 INFO L225 Difference]: With dead ends: 484 [2018-10-10 15:23:28,906 INFO L226 Difference]: Without dead ends: 484 [2018-10-10 15:23:28,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:23:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-10 15:23:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 401. [2018-10-10 15:23:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-10 15:23:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 406 transitions. [2018-10-10 15:23:28,915 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 406 transitions. Word has length 315 [2018-10-10 15:23:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:28,916 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 406 transitions. [2018-10-10 15:23:28,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:23:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 406 transitions. [2018-10-10 15:23:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-10 15:23:28,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:28,919 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:28,919 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:28,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash 143227966, now seen corresponding path program 11 times [2018-10-10 15:23:28,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 1133 proven. 950 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-10 15:23:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:23:29,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:23:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:23:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:23:29,489 INFO L87 Difference]: Start difference. First operand 401 states and 406 transitions. Second operand 20 states. [2018-10-10 15:23:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:30,395 INFO L93 Difference]: Finished difference Result 431 states and 436 transitions. [2018-10-10 15:23:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:23:30,403 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 400 [2018-10-10 15:23:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:30,406 INFO L225 Difference]: With dead ends: 431 [2018-10-10 15:23:30,406 INFO L226 Difference]: Without dead ends: 431 [2018-10-10 15:23:30,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:23:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-10 15:23:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-10 15:23:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-10 15:23:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 436 transitions. [2018-10-10 15:23:30,417 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 436 transitions. Word has length 400 [2018-10-10 15:23:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:30,418 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 436 transitions. [2018-10-10 15:23:30,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:23:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 436 transitions. [2018-10-10 15:23:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-10 15:23:30,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:30,422 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:30,423 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:30,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 482425844, now seen corresponding path program 12 times [2018-10-10 15:23:30,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:31,373 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:23:31,620 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:23:32,697 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:23:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2878 backedges. 0 proven. 2409 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-10 15:23:33,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:33,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:23:33,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:23:33,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:23:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:23:33,855 INFO L87 Difference]: Start difference. First operand 431 states and 436 transitions. Second operand 22 states. [2018-10-10 15:23:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:36,398 INFO L93 Difference]: Finished difference Result 629 states and 636 transitions. [2018-10-10 15:23:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:23:36,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 430 [2018-10-10 15:23:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:36,403 INFO L225 Difference]: With dead ends: 629 [2018-10-10 15:23:36,403 INFO L226 Difference]: Without dead ends: 629 [2018-10-10 15:23:36,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:23:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-10 15:23:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 531. [2018-10-10 15:23:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-10 15:23:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 537 transitions. [2018-10-10 15:23:36,412 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 537 transitions. Word has length 430 [2018-10-10 15:23:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:36,413 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 537 transitions. [2018-10-10 15:23:36,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:23:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 537 transitions. [2018-10-10 15:23:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-10 15:23:36,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:36,417 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:36,417 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:36,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash -599200289, now seen corresponding path program 13 times [2018-10-10 15:23:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4619 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2018-10-10 15:23:38,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:38,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:23:38,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:23:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:23:38,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:23:38,698 INFO L87 Difference]: Start difference. First operand 531 states and 537 transitions. Second operand 24 states. [2018-10-10 15:23:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:41,916 INFO L93 Difference]: Finished difference Result 729 states and 737 transitions. [2018-10-10 15:23:41,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:23:41,917 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 530 [2018-10-10 15:23:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:41,921 INFO L225 Difference]: With dead ends: 729 [2018-10-10 15:23:41,921 INFO L226 Difference]: Without dead ends: 729 [2018-10-10 15:23:41,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=371, Invalid=2281, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:23:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-10 15:23:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 631. [2018-10-10 15:23:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-10 15:23:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 638 transitions. [2018-10-10 15:23:41,933 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 638 transitions. Word has length 530 [2018-10-10 15:23:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:41,934 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 638 transitions. [2018-10-10 15:23:41,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:23:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 638 transitions. [2018-10-10 15:23:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-10 15:23:41,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:41,939 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:41,939 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:41,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2028105290, now seen corresponding path program 14 times [2018-10-10 15:23:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6770 backedges. 0 proven. 5991 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2018-10-10 15:23:43,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:43,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:23:43,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:23:43,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:23:43,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:23:43,941 INFO L87 Difference]: Start difference. First operand 631 states and 638 transitions. Second operand 26 states. [2018-10-10 15:23:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:47,043 INFO L93 Difference]: Finished difference Result 829 states and 838 transitions. [2018-10-10 15:23:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:23:47,044 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 630 [2018-10-10 15:23:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:47,048 INFO L225 Difference]: With dead ends: 829 [2018-10-10 15:23:47,048 INFO L226 Difference]: Without dead ends: 829 [2018-10-10 15:23:47,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:23:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-10 15:23:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 731. [2018-10-10 15:23:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-10 15:23:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 739 transitions. [2018-10-10 15:23:47,061 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 739 transitions. Word has length 630 [2018-10-10 15:23:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:47,061 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 739 transitions. [2018-10-10 15:23:47,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:23:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 739 transitions. [2018-10-10 15:23:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-10 15:23:47,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:47,067 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:47,068 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:47,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 309624117, now seen corresponding path program 15 times [2018-10-10 15:23:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9331 backedges. 0 proven. 8397 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2018-10-10 15:23:49,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:49,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:23:49,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:23:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:23:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:23:49,819 INFO L87 Difference]: Start difference. First operand 731 states and 739 transitions. Second operand 28 states. [2018-10-10 15:23:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:53,704 INFO L93 Difference]: Finished difference Result 929 states and 939 transitions. [2018-10-10 15:23:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:23:53,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 730 [2018-10-10 15:23:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:53,707 INFO L225 Difference]: With dead ends: 929 [2018-10-10 15:23:53,708 INFO L226 Difference]: Without dead ends: 929 [2018-10-10 15:23:53,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:23:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-10 15:23:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 831. [2018-10-10 15:23:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-10 15:23:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 840 transitions. [2018-10-10 15:23:53,721 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 840 transitions. Word has length 730 [2018-10-10 15:23:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:53,722 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 840 transitions. [2018-10-10 15:23:53,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:23:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 840 transitions. [2018-10-10 15:23:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-10 15:23:53,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:53,730 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:53,730 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:53,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1769612640, now seen corresponding path program 16 times [2018-10-10 15:23:53,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12302 backedges. 0 proven. 11213 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-10-10 15:23:57,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:57,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:23:57,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:23:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:23:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:23:57,630 INFO L87 Difference]: Start difference. First operand 831 states and 840 transitions. Second operand 30 states. [2018-10-10 15:24:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:01,846 INFO L93 Difference]: Finished difference Result 1029 states and 1040 transitions. [2018-10-10 15:24:01,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:24:01,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 830 [2018-10-10 15:24:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:01,850 INFO L225 Difference]: With dead ends: 1029 [2018-10-10 15:24:01,850 INFO L226 Difference]: Without dead ends: 1029 [2018-10-10 15:24:01,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=500, Invalid=3922, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:24:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-10-10 15:24:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 931. [2018-10-10 15:24:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-10 15:24:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 941 transitions. [2018-10-10 15:24:01,863 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 941 transitions. Word has length 830 [2018-10-10 15:24:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:01,864 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 941 transitions. [2018-10-10 15:24:01,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:24:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 941 transitions. [2018-10-10 15:24:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2018-10-10 15:24:01,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:01,872 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:01,873 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:01,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1883063947, now seen corresponding path program 17 times [2018-10-10 15:24:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:02,607 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:24:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15683 backedges. 0 proven. 14439 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-10-10 15:24:06,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:06,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:24:06,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:24:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:24:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:24:06,289 INFO L87 Difference]: Start difference. First operand 931 states and 941 transitions. Second operand 32 states. [2018-10-10 15:24:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:10,981 INFO L93 Difference]: Finished difference Result 1129 states and 1141 transitions. [2018-10-10 15:24:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:24:10,981 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 930 [2018-10-10 15:24:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:10,986 INFO L225 Difference]: With dead ends: 1129 [2018-10-10 15:24:10,986 INFO L226 Difference]: Without dead ends: 1129 [2018-10-10 15:24:10,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=543, Invalid=4569, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:24:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2018-10-10 15:24:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1031. [2018-10-10 15:24:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-10 15:24:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1042 transitions. [2018-10-10 15:24:11,000 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1042 transitions. Word has length 930 [2018-10-10 15:24:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:11,001 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1042 transitions. [2018-10-10 15:24:11,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:24:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1042 transitions. [2018-10-10 15:24:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2018-10-10 15:24:11,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:11,011 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:11,011 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:11,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash 945914102, now seen corresponding path program 18 times [2018-10-10 15:24:11,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:11,815 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 15:24:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19474 backedges. 0 proven. 18075 refuted. 0 times theorem prover too weak. 1399 trivial. 0 not checked. [2018-10-10 15:24:15,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:15,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:24:15,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:24:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:24:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:24:15,936 INFO L87 Difference]: Start difference. First operand 1031 states and 1042 transitions. Second operand 34 states. [2018-10-10 15:24:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:21,544 INFO L93 Difference]: Finished difference Result 1229 states and 1242 transitions. [2018-10-10 15:24:21,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:24:21,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1030 [2018-10-10 15:24:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:21,550 INFO L225 Difference]: With dead ends: 1229 [2018-10-10 15:24:21,550 INFO L226 Difference]: Without dead ends: 1229 [2018-10-10 15:24:21,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=586, Invalid=5266, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:24:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-10 15:24:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1131. [2018-10-10 15:24:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2018-10-10 15:24:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1143 transitions. [2018-10-10 15:24:21,564 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1143 transitions. Word has length 1030 [2018-10-10 15:24:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:21,565 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1143 transitions. [2018-10-10 15:24:21,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:24:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1143 transitions. [2018-10-10 15:24:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2018-10-10 15:24:21,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:21,577 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:21,577 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:21,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1700350433, now seen corresponding path program 19 times [2018-10-10 15:24:21,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23675 backedges. 0 proven. 22121 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2018-10-10 15:24:27,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:27,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:24:27,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:24:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:24:27,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:24:27,022 INFO L87 Difference]: Start difference. First operand 1131 states and 1143 transitions. Second operand 36 states. [2018-10-10 15:24:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:33,820 INFO L93 Difference]: Finished difference Result 1329 states and 1343 transitions. [2018-10-10 15:24:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:24:33,822 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1130 [2018-10-10 15:24:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:33,827 INFO L225 Difference]: With dead ends: 1329 [2018-10-10 15:24:33,827 INFO L226 Difference]: Without dead ends: 1329 [2018-10-10 15:24:33,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=629, Invalid=6013, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:24:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-10 15:24:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1231. [2018-10-10 15:24:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2018-10-10 15:24:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1244 transitions. [2018-10-10 15:24:33,842 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1244 transitions. Word has length 1130 [2018-10-10 15:24:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:33,843 INFO L481 AbstractCegarLoop]: Abstraction has 1231 states and 1244 transitions. [2018-10-10 15:24:33,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:24:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1244 transitions. [2018-10-10 15:24:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1231 [2018-10-10 15:24:33,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:33,855 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:33,856 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:33,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash -81043124, now seen corresponding path program 20 times [2018-10-10 15:24:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28286 backedges. 0 proven. 26577 refuted. 0 times theorem prover too weak. 1709 trivial. 0 not checked. [2018-10-10 15:24:40,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:40,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:24:40,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:24:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:24:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:24:40,191 INFO L87 Difference]: Start difference. First operand 1231 states and 1244 transitions. Second operand 38 states. [2018-10-10 15:24:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:47,630 INFO L93 Difference]: Finished difference Result 1429 states and 1444 transitions. [2018-10-10 15:24:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:24:47,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1230 [2018-10-10 15:24:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:47,635 INFO L225 Difference]: With dead ends: 1429 [2018-10-10 15:24:47,635 INFO L226 Difference]: Without dead ends: 1429 [2018-10-10 15:24:47,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=672, Invalid=6810, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:24:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2018-10-10 15:24:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1331. [2018-10-10 15:24:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-10 15:24:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1345 transitions. [2018-10-10 15:24:47,652 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1345 transitions. Word has length 1230 [2018-10-10 15:24:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:47,653 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 1345 transitions. [2018-10-10 15:24:47,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:24:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1345 transitions. [2018-10-10 15:24:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1331 [2018-10-10 15:24:47,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:47,667 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:47,668 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:47,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 998147895, now seen corresponding path program 21 times [2018-10-10 15:24:47,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 33307 backedges. 0 proven. 31443 refuted. 0 times theorem prover too weak. 1864 trivial. 0 not checked. [2018-10-10 15:24:54,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:54,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:24:54,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:24:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:24:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:24:54,403 INFO L87 Difference]: Start difference. First operand 1331 states and 1345 transitions. Second operand 40 states. [2018-10-10 15:25:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:02,727 INFO L93 Difference]: Finished difference Result 1529 states and 1545 transitions. [2018-10-10 15:25:02,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:25:02,728 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1330 [2018-10-10 15:25:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:02,732 INFO L225 Difference]: With dead ends: 1529 [2018-10-10 15:25:02,732 INFO L226 Difference]: Without dead ends: 1529 [2018-10-10 15:25:02,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=715, Invalid=7657, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:25:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-10 15:25:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1431. [2018-10-10 15:25:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2018-10-10 15:25:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1446 transitions. [2018-10-10 15:25:02,749 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1446 transitions. Word has length 1330 [2018-10-10 15:25:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:02,750 INFO L481 AbstractCegarLoop]: Abstraction has 1431 states and 1446 transitions. [2018-10-10 15:25:02,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:25:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1446 transitions. [2018-10-10 15:25:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1431 [2018-10-10 15:25:02,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:02,769 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:02,769 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:02,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1436122018, now seen corresponding path program 22 times [2018-10-10 15:25:02,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 38738 backedges. 0 proven. 36719 refuted. 0 times theorem prover too weak. 2019 trivial. 0 not checked. [2018-10-10 15:25:11,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:11,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:25:11,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:25:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:25:11,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:25:11,047 INFO L87 Difference]: Start difference. First operand 1431 states and 1446 transitions. Second operand 42 states. [2018-10-10 15:25:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:20,103 INFO L93 Difference]: Finished difference Result 1629 states and 1646 transitions. [2018-10-10 15:25:20,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:25:20,103 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1430 [2018-10-10 15:25:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:20,109 INFO L225 Difference]: With dead ends: 1629 [2018-10-10 15:25:20,109 INFO L226 Difference]: Without dead ends: 1629 [2018-10-10 15:25:20,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=758, Invalid=8554, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:25:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-10-10 15:25:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1531. [2018-10-10 15:25:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2018-10-10 15:25:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1547 transitions. [2018-10-10 15:25:20,123 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1547 transitions. Word has length 1430 [2018-10-10 15:25:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:20,124 INFO L481 AbstractCegarLoop]: Abstraction has 1531 states and 1547 transitions. [2018-10-10 15:25:20,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:25:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1547 transitions. [2018-10-10 15:25:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1531 [2018-10-10 15:25:20,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:20,143 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:20,143 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:20,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:20,144 INFO L82 PathProgramCache]: Analyzing trace with hash 375586445, now seen corresponding path program 23 times [2018-10-10 15:25:20,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 44579 backedges. 0 proven. 42405 refuted. 0 times theorem prover too weak. 2174 trivial. 0 not checked. [2018-10-10 15:25:29,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:25:29,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:25:29,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:25:29,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:25:29,211 INFO L87 Difference]: Start difference. First operand 1531 states and 1547 transitions. Second operand 44 states. [2018-10-10 15:25:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:39,088 INFO L93 Difference]: Finished difference Result 1729 states and 1747 transitions. [2018-10-10 15:25:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:25:39,088 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1530 [2018-10-10 15:25:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:39,093 INFO L225 Difference]: With dead ends: 1729 [2018-10-10 15:25:39,093 INFO L226 Difference]: Without dead ends: 1729 [2018-10-10 15:25:39,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=801, Invalid=9501, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:25:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-10-10 15:25:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1631. [2018-10-10 15:25:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-10-10 15:25:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1648 transitions. [2018-10-10 15:25:39,107 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1648 transitions. Word has length 1530 [2018-10-10 15:25:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:39,108 INFO L481 AbstractCegarLoop]: Abstraction has 1631 states and 1648 transitions. [2018-10-10 15:25:39,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:25:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1648 transitions. [2018-10-10 15:25:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1631 [2018-10-10 15:25:39,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:39,129 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:39,129 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:39,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1738420232, now seen corresponding path program 24 times [2018-10-10 15:25:39,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 50830 backedges. 0 proven. 48501 refuted. 0 times theorem prover too weak. 2329 trivial. 0 not checked. [2018-10-10 15:25:49,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:49,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:25:49,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:25:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:25:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:25:49,345 INFO L87 Difference]: Start difference. First operand 1631 states and 1648 transitions. Second operand 46 states. [2018-10-10 15:26:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:00,944 INFO L93 Difference]: Finished difference Result 1829 states and 1848 transitions. [2018-10-10 15:26:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:26:00,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1630 [2018-10-10 15:26:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:00,950 INFO L225 Difference]: With dead ends: 1829 [2018-10-10 15:26:00,950 INFO L226 Difference]: Without dead ends: 1829 [2018-10-10 15:26:00,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=844, Invalid=10498, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:26:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2018-10-10 15:26:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1731. [2018-10-10 15:26:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-10-10 15:26:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 1749 transitions. [2018-10-10 15:26:00,966 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 1749 transitions. Word has length 1630 [2018-10-10 15:26:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:00,967 INFO L481 AbstractCegarLoop]: Abstraction has 1731 states and 1749 transitions. [2018-10-10 15:26:00,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:26:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 1749 transitions. [2018-10-10 15:26:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2018-10-10 15:26:00,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:00,991 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:00,992 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:00,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash -205738013, now seen corresponding path program 25 times [2018-10-10 15:26:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:02,909 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:26:03,358 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-10 15:26:03,604 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-10 15:26:03,895 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-10-10 15:26:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 57491 backedges. 0 proven. 55007 refuted. 0 times theorem prover too weak. 2484 trivial. 0 not checked. [2018-10-10 15:26:14,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:14,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:26:14,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:26:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:26:14,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:26:14,175 INFO L87 Difference]: Start difference. First operand 1731 states and 1749 transitions. Second operand 48 states. [2018-10-10 15:26:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:27,114 INFO L93 Difference]: Finished difference Result 1929 states and 1949 transitions. [2018-10-10 15:26:27,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:26:27,114 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1730 [2018-10-10 15:26:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:27,120 INFO L225 Difference]: With dead ends: 1929 [2018-10-10 15:26:27,121 INFO L226 Difference]: Without dead ends: 1929 [2018-10-10 15:26:27,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=887, Invalid=11545, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:26:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-10-10 15:26:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1831. [2018-10-10 15:26:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1831 states. [2018-10-10 15:26:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 1850 transitions. [2018-10-10 15:26:27,136 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 1850 transitions. Word has length 1730 [2018-10-10 15:26:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:27,136 INFO L481 AbstractCegarLoop]: Abstraction has 1831 states and 1850 transitions. [2018-10-10 15:26:27,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:26:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 1850 transitions. [2018-10-10 15:26:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1831 [2018-10-10 15:26:27,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:27,160 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:27,161 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:27,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash -298164658, now seen corresponding path program 26 times [2018-10-10 15:26:27,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 64562 backedges. 0 proven. 61923 refuted. 0 times theorem prover too weak. 2639 trivial. 0 not checked. [2018-10-10 15:26:39,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:26:39,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:26:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:26:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2308, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:26:39,454 INFO L87 Difference]: Start difference. First operand 1831 states and 1850 transitions. Second operand 50 states. [2018-10-10 15:26:52,127 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-10 15:26:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:53,892 INFO L93 Difference]: Finished difference Result 2029 states and 2050 transitions. [2018-10-10 15:26:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:26:53,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1830 [2018-10-10 15:26:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:53,899 INFO L225 Difference]: With dead ends: 2029 [2018-10-10 15:26:53,899 INFO L226 Difference]: Without dead ends: 2029 [2018-10-10 15:26:53,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=930, Invalid=12642, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 15:26:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2018-10-10 15:26:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1931. [2018-10-10 15:26:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2018-10-10 15:26:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 1951 transitions. [2018-10-10 15:26:53,913 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 1951 transitions. Word has length 1830 [2018-10-10 15:26:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:53,914 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 1951 transitions. [2018-10-10 15:26:53,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:26:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 1951 transitions. [2018-10-10 15:26:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1931 [2018-10-10 15:26:53,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:53,934 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 94, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:53,934 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:53,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:53,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1421763783, now seen corresponding path program 27 times [2018-10-10 15:26:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:55,236 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 15:27:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 72043 backedges. 0 proven. 69249 refuted. 0 times theorem prover too weak. 2794 trivial. 0 not checked. [2018-10-10 15:27:07,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:07,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:27:07,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:27:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:27:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2504, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:27:07,851 INFO L87 Difference]: Start difference. First operand 1931 states and 1951 transitions. Second operand 52 states. [2018-10-10 15:27:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:22,522 INFO L93 Difference]: Finished difference Result 2129 states and 2151 transitions. [2018-10-10 15:27:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:27:22,523 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1930 [2018-10-10 15:27:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:22,529 INFO L225 Difference]: With dead ends: 2129 [2018-10-10 15:27:22,529 INFO L226 Difference]: Without dead ends: 2129 [2018-10-10 15:27:22,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=973, Invalid=13789, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:27:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2018-10-10 15:27:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2031. [2018-10-10 15:27:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2018-10-10 15:27:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 2052 transitions. [2018-10-10 15:27:22,545 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 2052 transitions. Word has length 1930 [2018-10-10 15:27:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:22,546 INFO L481 AbstractCegarLoop]: Abstraction has 2031 states and 2052 transitions. [2018-10-10 15:27:22,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:27:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 2052 transitions. [2018-10-10 15:27:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2031 [2018-10-10 15:27:22,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:22,568 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:22,570 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:22,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:22,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1540957860, now seen corresponding path program 28 times [2018-10-10 15:27:22,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 79934 backedges. 0 proven. 76985 refuted. 0 times theorem prover too weak. 2949 trivial. 0 not checked. [2018-10-10 15:27:36,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:36,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:27:36,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:27:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:27:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2708, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:27:36,702 INFO L87 Difference]: Start difference. First operand 2031 states and 2052 transitions. Second operand 54 states. [2018-10-10 15:27:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:52,889 INFO L93 Difference]: Finished difference Result 2229 states and 2252 transitions. [2018-10-10 15:27:52,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:27:52,890 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2030 [2018-10-10 15:27:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:52,896 INFO L225 Difference]: With dead ends: 2229 [2018-10-10 15:27:52,896 INFO L226 Difference]: Without dead ends: 2229 [2018-10-10 15:27:52,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1016, Invalid=14986, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:27:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2018-10-10 15:27:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2131. [2018-10-10 15:27:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2018-10-10 15:27:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2153 transitions. [2018-10-10 15:27:52,911 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2153 transitions. Word has length 2030 [2018-10-10 15:27:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:52,912 INFO L481 AbstractCegarLoop]: Abstraction has 2131 states and 2153 transitions. [2018-10-10 15:27:52,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:27:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2153 transitions. [2018-10-10 15:27:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-10 15:27:52,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:52,937 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 104, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:27:52,937 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:52,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -290996081, now seen corresponding path program 29 times [2018-10-10 15:27:52,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 88235 backedges. 0 proven. 85131 refuted. 0 times theorem prover too weak. 3104 trivial. 0 not checked. [2018-10-10 15:28:08,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:08,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:28:08,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:28:08,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:28:08,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2920, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:28:08,230 INFO L87 Difference]: Start difference. First operand 2131 states and 2153 transitions. Second operand 56 states. [2018-10-10 15:28:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:25,289 INFO L93 Difference]: Finished difference Result 2329 states and 2353 transitions. [2018-10-10 15:28:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:28:25,290 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2130 [2018-10-10 15:28:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:25,299 INFO L225 Difference]: With dead ends: 2329 [2018-10-10 15:28:25,299 INFO L226 Difference]: Without dead ends: 2329 [2018-10-10 15:28:25,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3289 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1059, Invalid=16233, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:28:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-10-10 15:28:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2231. [2018-10-10 15:28:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-10-10 15:28:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2254 transitions. [2018-10-10 15:28:25,318 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2254 transitions. Word has length 2130 [2018-10-10 15:28:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:25,319 INFO L481 AbstractCegarLoop]: Abstraction has 2231 states and 2254 transitions. [2018-10-10 15:28:25,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:28:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2254 transitions. [2018-10-10 15:28:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2231 [2018-10-10 15:28:25,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:25,347 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:28:25,347 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:25,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1074517766, now seen corresponding path program 30 times [2018-10-10 15:28:25,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 96946 backedges. 0 proven. 93687 refuted. 0 times theorem prover too weak. 3259 trivial. 0 not checked. [2018-10-10 15:28:41,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:42,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:28:42,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:28:42,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:28:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3140, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:28:42,002 INFO L87 Difference]: Start difference. First operand 2231 states and 2254 transitions. Second operand 58 states. [2018-10-10 15:29:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:00,619 INFO L93 Difference]: Finished difference Result 2429 states and 2454 transitions. [2018-10-10 15:29:00,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:29:00,619 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2230 [2018-10-10 15:29:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:00,625 INFO L225 Difference]: With dead ends: 2429 [2018-10-10 15:29:00,625 INFO L226 Difference]: Without dead ends: 2429 [2018-10-10 15:29:00,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1102, Invalid=17530, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 15:29:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2018-10-10 15:29:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2331. [2018-10-10 15:29:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2018-10-10 15:29:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 2355 transitions. [2018-10-10 15:29:00,648 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 2355 transitions. Word has length 2230 [2018-10-10 15:29:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:00,650 INFO L481 AbstractCegarLoop]: Abstraction has 2331 states and 2355 transitions. [2018-10-10 15:29:00,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:29:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2355 transitions. [2018-10-10 15:29:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2331 [2018-10-10 15:29:00,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:00,683 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:00,683 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:00,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1235558373, now seen corresponding path program 31 times [2018-10-10 15:29:00,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:29:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 106067 backedges. 0 proven. 102653 refuted. 0 times theorem prover too weak. 3414 trivial. 0 not checked. [2018-10-10 15:29:19,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:29:19,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:29:19,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:29:19,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:29:19,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3368, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:29:19,035 INFO L87 Difference]: Start difference. First operand 2331 states and 2355 transitions. Second operand 60 states. [2018-10-10 15:29:23,387 WARN L178 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-10 15:29:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:29:40,512 INFO L93 Difference]: Finished difference Result 2529 states and 2555 transitions. [2018-10-10 15:29:40,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:29:40,512 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2330 [2018-10-10 15:29:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:29:40,517 INFO L225 Difference]: With dead ends: 2529 [2018-10-10 15:29:40,517 INFO L226 Difference]: Without dead ends: 2529 [2018-10-10 15:29:40,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3798 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1145, Invalid=18877, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:29:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2018-10-10 15:29:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2431. [2018-10-10 15:29:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2018-10-10 15:29:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 2456 transitions. [2018-10-10 15:29:40,540 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 2456 transitions. Word has length 2330 [2018-10-10 15:29:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:29:40,541 INFO L481 AbstractCegarLoop]: Abstraction has 2431 states and 2456 transitions. [2018-10-10 15:29:40,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:29:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 2456 transitions. [2018-10-10 15:29:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2431 [2018-10-10 15:29:40,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:29:40,573 INFO L375 BasicCegarLoop]: trace histogram [119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 119, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:29:40,574 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:29:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:29:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -750688944, now seen corresponding path program 32 times [2018-10-10 15:29:40,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:29:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 115598 backedges. 0 proven. 112029 refuted. 0 times theorem prover too weak. 3569 trivial. 0 not checked. [2018-10-10 15:30:00,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:00,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:30:00,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:30:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:30:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3604, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:30:00,064 INFO L87 Difference]: Start difference. First operand 2431 states and 2456 transitions. Second operand 62 states. [2018-10-10 15:30:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:30:22,252 INFO L93 Difference]: Finished difference Result 2629 states and 2656 transitions. [2018-10-10 15:30:22,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:30:22,258 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2430 [2018-10-10 15:30:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:30:22,262 INFO L225 Difference]: With dead ends: 2629 [2018-10-10 15:30:22,262 INFO L226 Difference]: Without dead ends: 2629 [2018-10-10 15:30:22,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1188, Invalid=20274, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 15:30:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2018-10-10 15:30:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2531. [2018-10-10 15:30:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2018-10-10 15:30:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 2557 transitions. [2018-10-10 15:30:22,283 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 2557 transitions. Word has length 2430 [2018-10-10 15:30:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:30:22,285 INFO L481 AbstractCegarLoop]: Abstraction has 2531 states and 2557 transitions. [2018-10-10 15:30:22,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:30:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 2557 transitions. [2018-10-10 15:30:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2531 [2018-10-10 15:30:22,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:30:22,321 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:30:22,321 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:30:22,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:30:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash 569358651, now seen corresponding path program 33 times [2018-10-10 15:30:22,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:30:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:30:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 125539 backedges. 0 proven. 121815 refuted. 0 times theorem prover too weak. 3724 trivial. 0 not checked. [2018-10-10 15:30:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:30:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:30:43,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:30:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:30:43,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3848, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:30:43,019 INFO L87 Difference]: Start difference. First operand 2531 states and 2557 transitions. Second operand 64 states. [2018-10-10 15:31:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:06,718 INFO L93 Difference]: Finished difference Result 2729 states and 2757 transitions. [2018-10-10 15:31:06,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:31:06,718 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2530 [2018-10-10 15:31:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:06,724 INFO L225 Difference]: With dead ends: 2729 [2018-10-10 15:31:06,724 INFO L226 Difference]: Without dead ends: 2729 [2018-10-10 15:31:06,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4343 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1231, Invalid=21721, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:31:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-10-10 15:31:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2631. [2018-10-10 15:31:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-10-10 15:31:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 2658 transitions. [2018-10-10 15:31:06,740 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 2658 transitions. Word has length 2530 [2018-10-10 15:31:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:06,741 INFO L481 AbstractCegarLoop]: Abstraction has 2631 states and 2658 transitions. [2018-10-10 15:31:06,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:31:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 2658 transitions. [2018-10-10 15:31:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2631 [2018-10-10 15:31:06,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:06,777 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 129, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:06,778 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:06,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash 678878118, now seen corresponding path program 34 times [2018-10-10 15:31:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:31:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 135890 backedges. 0 proven. 132011 refuted. 0 times theorem prover too weak. 3879 trivial. 0 not checked. [2018-10-10 15:31:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:31:29,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:31:29,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:31:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:31:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=4100, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:31:29,290 INFO L87 Difference]: Start difference. First operand 2631 states and 2658 transitions. Second operand 66 states. [2018-10-10 15:31:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:31:54,674 INFO L93 Difference]: Finished difference Result 2829 states and 2858 transitions. [2018-10-10 15:31:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:31:54,674 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 2630 [2018-10-10 15:31:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:31:54,680 INFO L225 Difference]: With dead ends: 2829 [2018-10-10 15:31:54,680 INFO L226 Difference]: Without dead ends: 2829 [2018-10-10 15:31:54,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4629 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1274, Invalid=23218, Unknown=0, NotChecked=0, Total=24492 [2018-10-10 15:31:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2018-10-10 15:31:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2731. [2018-10-10 15:31:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-10-10 15:31:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 2759 transitions. [2018-10-10 15:31:54,701 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 2759 transitions. Word has length 2630 [2018-10-10 15:31:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:31:54,703 INFO L481 AbstractCegarLoop]: Abstraction has 2731 states and 2759 transitions. [2018-10-10 15:31:54,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:31:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 2759 transitions. [2018-10-10 15:31:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2731 [2018-10-10 15:31:54,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:31:54,759 INFO L375 BasicCegarLoop]: trace histogram [134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 134, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:31:54,760 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:31:54,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:31:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1220703087, now seen corresponding path program 35 times [2018-10-10 15:31:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:31:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat